413 search results - page 6 / 83 » Computing and Exploiting Tree-Decompositions for Solving Con... |
ICNP
2005
IEEE
15 years 4 months ago
2005
IEEE
In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While i...
CP
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
COR
2010
14 years 11 months ago
2010
In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework...
54
Voted
ESANN
2007
15 years 22 days ago
2007
The so called MSO-problem, – a simple superposition of two or more sinusoidal waves –, has recently been discussed as a benchmark problem for reservoir computing and was shown ...
AAAI
2006
15 years 21 days ago
2006
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...