Sciweavers

1840 search results - page 30 / 368
» time 2002
Sort
View
WG
2005
Springer
15 years 5 months ago
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
Pinar Heggernes, Daniel Lokshtanov
DM
2006
108views more  DM 2006»
14 years 11 months ago
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
Pinar Heggernes, Daniel Lokshtanov
JPDC
2002
104views more  JPDC 2002»
14 years 11 months ago
Fully dynamic distributed search trees can be balanced in O(lg2 N) time
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
Fabio Barillari, Enrico Nardelli, Massimo Pepe
ICCD
1999
IEEE
91views Hardware» more  ICCD 1999»
15 years 4 months ago
Architectural Synthesis of Timed Asynchronous Systems
ions", in IEEE Transactions on CAD of VLSI, 25(3):403-412, March, 2006. , E. Mercer, C. Myers, "Modular Verification of Timed Systems Using Automatic Abstraction" in...
Brandon M. Bachman, Hao Zheng, Chris J. Myers
ANOR
2002
57views more  ANOR 2002»
14 years 11 months ago
Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing
Abstract: We define events so as to reduce the number of events and decision variables needed for modeling batchscheduling problems such as described in [Westenberger and Kallrath ...
Siqun Wang, Monique Guignard