Results 11 to 20 of about 30,070,977 (302)
The science in computer science [PDF]
Computer science is in a period of renaissance as it rediscovers its science roots.
Denning, Peter J.
core +4 more sources
Learning objectives for courses in the Department of Computer Science, Oregon State University [PDF]
This document describes the overall learning objectives for courses in the department of computer science at Oregon State ...
Oregon State University. Department of Computer Science
core +6 more sources
Enumerating Answers to First-Order Queries over Databases of Low Degree [PDF]
A class of relational databases has low degree if for all $\delta>0$, all but finitely many databases in the class have degree at most $n^{\delta}$, where $n$ is the size of the database.
Arnaud Durand +2 more
doaj +1 more source
Possible for science itself, conceptually, to have and will understand differently, let alone science also seen as technology, such as computer science. After all, science and technology are viewpoints diverse by either individual, community, or social. Generally, it depends on socioeconomic capabilities.
Mahyuddin K. M. Nasution +2 more
openaire +3 more sources
When Can We Answer Queries Using Result-Bounded Data Interfaces? [PDF]
We consider answering queries on data available through access methods, that provide lookup access to the tuples matching a given binding. Such interfaces are common on the Web; further, they often have bounds on how many results they can return, e.g ...
Antoine Amarilli, Michael Benedikt
doaj +1 more source
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games [PDF]
We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible.
Thomas Brihaye +4 more
doaj +1 more source
Efficient Evaluation of Arbitrary Relational Calculus Queries [PDF]
The relational calculus (RC) is a concise, declarative query language. However, existing RC query evaluation approaches are inefficient and often deviate from established algorithms based on finite tables used in database management systems.
Martin Raszyk +3 more
doaj +1 more source
Parity and Streett Games with Costs [PDF]
We consider two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses.
Nathanaël Fijalkow, Martin Zimmermann
doaj +1 more source
Robustness against Read Committed for Transaction Templates with Functional Constraints [PDF]
The popular isolation level Multiversion Read Committed (RC) trades some of the strong guarantees of serializability for increased transaction throughput.
Brecht Vandevoort +3 more
doaj +1 more source
Relative Entailment Among Probabilistic Implications [PDF]
We study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort of implication is defined in ...
Albert Atserias +2 more
doaj +1 more source

