Sciweavers

2629 search results - page 127 / 526
» complex 2009
Sort
View
CP
2009
Springer
16 years 7 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
ESAW
2009
Springer
16 years 1 months ago
A Space-Based Generic Pattern for Self-Initiative Load Balancing Agents
Abstract. Load-Balancing is a significant problem in heterogeneous distributed systems. There exist many load balancing algorithms, however, most approaches are very problem speci...
eva Kühn, Vesna Sesum-Cavic
CSL
2009
Springer
16 years 1 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
16 years 1 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
SEMWEB
2009
Springer
16 years 1 months ago
Queries to Hybrid MKNF Knowledge Bases through Oracular Tabling
An important issue for the Semantic Web is how to combine open-world ontology languages with closed-world (non-monotonic) rule paradigms. Several proposals for hybrid languages all...
José Júlio Alferes, Matthias Knorr, ...