1274 search results - page 44 / 255 » Graph lambda theories |
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
GECCO
2006
Springer
14 years 15 days ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
Earlier work has developed the underpinnings of IC-Scheduling Theory, an algorithmic framework for scheduling computations having intertask dependencies for Internet-based computi...
Book
This book is aimed at senior undergraduates and graduate students in Engineering, Science, Mathematics, and Computing. It expects familiarity with calculus, probability theory, and...
ILP
2000
Springer
14 years 12 days ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...