14548 search results - page 2701 / 2910 » The Optimal Path-Matching Problem |
279
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
155
click to vote
SPDP
1993
IEEE
15 years 10 months ago
1993
IEEE
In this paper, we propose a new parallel genetic alge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantag...
165
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
196
click to vote
ALP
1992
Springer
15 years 10 months ago
1992
Springer
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
163
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...