994 search results - page 24 / 199 » Custom Computing Machines for the Set Covering Problem |
112
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
115
click to vote
FSTTCS
2010
Springer
14 years 11 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
95
Voted
EUROPAR
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we consider the problem of modeling machine availability in enterprise-area and wide-area distributed computing settings. Using availability data gathered from three...
113
Voted
FPLAY
2008
15 years 2 months ago
2008
Video games are varied, with vastly different visual layouts and interaction styles; however, most games that share a common genre still have many user interface similarities. The...
82
Voted
DAC
2001
ACM
16 years 2 months ago
2001
ACM
We present a methodology for microarchitectural customization of embedded processors by exploiting application information, thus attaining the twin benefits of processor standardi...