Sciweavers

4940 search results - page 545 / 988
» On the Complexity of Universal Programs
Sort
View
188
Voted
SIGSOFT
2008
ACM
16 years 7 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
CD
2005
Springer
16 years 11 days ago
Modelling Deployment Using Feature Descriptions and State Models for Component-Based Software Product Families
Abstract. Products within a product family are composed of different component configurations where components have different variable features and a large amount of dependency re...
Slinger Jansen, Sjaak Brinkkemper
EH
1999
IEEE
214views Hardware» more  EH 1999»
15 years 11 months ago
Coevolutionary Robotics
We address the fundamental issue of fully automated design (FAD) and construction of inexpensive robots and their controllers. Rather than seek an intelligent general purpose robo...
Jordan B. Pollack, Hod Lipson, Pablo Funes, Sevan ...
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 7 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
ICALP
2009
Springer
16 years 7 months ago
A Survey of Stochastic Games with Limsup and Liminf Objectives
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...