Sciweavers

12 search results - page 1 / 3
» Dynamic Grid Embedding with Few Bends and Changes
Sort
View
ISAAC
1998
Springer
88views Algorithms» more  ISAAC 1998»
14 years 3 months ago
Dynamic Grid Embedding with Few Bends and Changes
Ulrik Brandes, Dorothea Wagner
GD
2004
Springer
14 years 4 months ago
Simultaneous Embedding of Planar Graphs with Few Bends
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
Cesim Erten, Stephen G. Kobourov
SEKE
2007
Springer
14 years 5 months ago
TRAP.NET: A Realization of Transparent Shaping in .NET
We define adaptability as the capacity of software in adjusting its behavior in response to changing conditions. To list just a few examples, adaptability is important in pervasiv...
Seyed Masoud Sadjadi, Fernando Trigoso
COORDINATION
2004
Springer
14 years 4 months ago
On Calculi for Context-Aware Coordination
Abstract. Modern distributed computing demands unprecedented levels of dynamicity and reconfiguration. Mobile computing, peer-to-peer networks, computational grids, multiagent sys...
Pietro Braione, Gian Pietro Picco
ECRTS
2006
IEEE
14 years 5 months ago
Optimal deadline assignment for periodic real-time tasks in dynamic priority systems
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified i...
Patricia Balbastre, Ismael Ripoll, Alfons Crespo