16091 search results - page 322 / 3219 » Solving |
183
click to vote
STACS
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
206
click to vote
AISC
2004
Springer
16 years 1 days ago
2004
Springer
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
129
click to vote
GECCO
2004
Springer
16 years 23 hour ago
2004
Springer
In this paper, a new genetic mating scheme called Controlled Content Crossover (CCC) is proposed and applied to solve the optical network component allocation problem. In order to ...
155
click to vote
ICCS
2004
Springer
16 years 18 hour ago
2004
Springer
Problem Solving Environments have a well established position as an essential tool for computational science. We focus our attention in this article on how to provide parallel com...
191
click to vote
SAT
2004
Springer
15 years 12 months ago
2004
Springer
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantifie...