245 search results - page 9 / 49 » Locating phase transitions in computationally hard problems |
RTSS
2002
IEEE
14 years 11 days ago
2002
IEEE
We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitt...
KR
2000
Springer
13 years 11 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We consider the problem of shape recovery for real world scenes, where a variety of global illumination (interreflections, subsurface scattering, etc.) and illumination defocus e...
IAT
2007
IEEE
14 years 1 months ago
2007
IEEE
— Multi-issue negotiations are a central component of many important coordination challenges. Almost all previous work in this area has assumed that negotiation issues are indepe...
DISOPT
2007
13 years 7 months ago
2007
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...