3136 search results - page 407 / 628 » Genetic programming theory |
165
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
178
click to vote
EMSOFT
2005
Springer
16 years 2 days ago
2005
Springer
systems are commonly abstracted as collections of interacting components. This perspective has lead to the insight that component behaviors can be defined separately from admissi...
175
click to vote
FOSSACS
2004
Springer
15 years 12 months ago
2004
Springer
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulati...
173
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
165
Voted
ISLPED
2003
ACM
15 years 11 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...