1725 search results - page 220 / 345 » Relaxed genetic programming |
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
ISSRE
2005
IEEE
15 years 3 months ago
2005
IEEE
Code prioritization for testing promises to achieve the maximum testing coverage with the least cost. This paper presents an innovative method to provide hints on which part of co...
ICPP
1991
IEEE
15 years 1 months ago
1991
IEEE
The memory consistency model supported by a multiprocessor directly affects its performance. Thus, several attempts have been made to relax the consistency models to allow for mor...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
AUTOMATICA
2005
14 years 10 months ago
2005
The number of states in discrete event systems can increase exponentially with respect to the size of the system. A way to face this state explosion problem consists of relaxing t...