Sciweavers

2597 search results - page 280 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
WABI
2005
Springer
15 years 7 months ago
Minimum Recombination Histories by Branch and Bound
Recombination plays an important role in creating genetic diversity within species, and inferring past recombination events is central to many problems in genetics. Given a set M o...
Rune B. Lyngsø, Yun S. Song, Jotun Hein
COMPGEOM
2004
ACM
15 years 7 months ago
Pushing squares around
We study dynamic self-reconfiguration of modular metamorphic systems. We guarantee the feasibility of motion planning in a rectangular model consisting of square modules that are...
Adrian Dumitrescu, János Pach
ATAL
2004
Springer
15 years 7 months ago
On the Communication Complexity of Multilateral Trading
We study the complexity of a multilateral negotiation framework where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both furthe...
Ulrich Endriss, Nicolas Maudet
ESA
2004
Springer
106views Algorithms» more  ESA 2004»
15 years 7 months ago
Stable Minimum Storage Merging by Symmetric Comparisons
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...
Pok-Son Kim, Arne Kutzner
IFIP
2004
Springer
15 years 7 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi