994 search results - page 24 / 199 » Custom Computing Machines for the Set Covering Problem |
GECCO
2007
Springer
14 years 1 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...
FSTTCS
2010
Springer
13 years 5 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...
EUROPAR
2005
Springer
14 years 1 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...
FPLAY
2008
13 years 9 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...
DAC
2001
ACM
14 years 8 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...