858 search results - page 140 / 172 » A Glimpse of Constraint Satisfaction |
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
We present a new method for instance-specific algorithm configuration (ISAC). It is based on the integration of the algorithm configuration system GGA and the recently proposed sto...
CPC
2006
13 years 7 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
JAIR
2008
13 years 7 months ago
2008
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
TWC
2008
13 years 7 months ago
2008
It is a challenging task for multi-hop wireless networks to support multimedia applications with quality-ofservice (QoS) requirements. This letter presents a joint crosslayer optim...
ICST
2010
IEEE
13 years 6 months ago
2010
IEEE
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...