Sciweavers

4201 search results - page 351 / 841
» Interaction graphs: Additives
Sort
View
CLA
2007
15 years 8 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
AIPS
2010
15 years 8 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
SIAMDM
2010
167views more  SIAMDM 2010»
15 years 1 months ago
Domination Game and an Imagination Strategy
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
RECOMB
2006
Springer
16 years 7 months ago
Probabilistic Paths for Protein Complex Inference
Understanding how individual proteins are organized into complexes and pathways is a significant current challenge. We introduce new algorithms to infer protein complexes by combin...
Hailiang Huang, Lan V. Zhang, Frederick P. Roth, J...
LCN
2008
IEEE
16 years 1 months ago
Constructing low-latency overlay networks: Tree vs. mesh algorithms
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...