Sciweavers

4759 search results - page 531 / 952
» Parallelizing the Phylogeny Problem
Sort
View
COCOON
2009
Springer
16 years 1 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura
COLCOM
2008
IEEE
16 years 1 months ago
Learning Models of the Negotiation Partner in Spatio-temporal Collaboration
Abstract. We describe an approach for learning the model of the opponent in spatio-temporal negotiation. We use the Children in the Rectangular Forest canonical problem as an examp...
Yi Luo, Ladislau Bölöni
ICDCSW
2008
IEEE
16 years 1 months ago
Mobility Control for Complete Coverage in Wireless Sensor Networks
In this paper, we propose a new control method to cover the “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are d...
Zhen Jiang, Jie Wu, Robert Kline, Jennifer Krantz
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
16 years 1 months ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
AIMSA
2008
Springer
16 years 1 months ago
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
Roman Barták, Ondrej Cepek