Sciweavers

9989 search results - page 1953 / 1998
» A CLP Approach to Modelling Systems
Sort
View
CIDR
2003
106views Algorithms» more  CIDR 2003»
15 years 1 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
AIIDE
2009
15 years 29 days ago
Demonstrating Automatic Content Generation in the Galactic Arms Race Video Game
In most modern video games, content (e.g. models, levels, weapons, etc.) shipped with the game is static and unchanging, or at best, randomized within a narrow set of parameters. ...
Erin J. Hastings, Ratan K. Guha, Kenneth O. Stanle...
DEBU
2008
100views more  DEBU 2008»
14 years 12 months ago
WAVE: Automatic Verification of Data-Driven Web Services
Data-driven Web services, viewed broadly as interactive systems available on the Web for users and programs, provide the backbone for increasingly complex Web applications. While ...
Alin Deutsch, Victor Vianu
BMCBI
2006
249views more  BMCBI 2006»
14 years 12 months ago
Gene functional similarity search tool (GFSST)
Background: With the completion of the genome sequences of human, mouse, and other species and the advent of high throughput functional genomic research technologies such as biomi...
Peisen Zhang, Jinghui Zhang, Huitao Sheng, James J...
ECCC
2007
90views more  ECCC 2007»
14 years 11 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
« Prev « First page 1953 / 1998 Last » Next »