994 search results - page 121 / 199 » Custom Computing Machines for the Set Covering Problem |
105
click to vote
ERSHOV
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...
127
Voted
SODA
2010
ACM
14 years 10 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
106
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
IGPL
2008
15 years 2 days ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...