303 search results - page 40 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
ALGORITHMICA
2011
13 years 2 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
IANDC
2008
13 years 7 months ago
2008
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
ICCS
2003
Springer
14 years 23 days ago
2003
Springer
Object oriented languages, in particular Java, use a frequent dynamic dispatch mechanism to search for the definition of an invoked method. A method could be defined in more than...
EOR
2011
13 years 2 months ago
2011
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
VLSID
2007
IEEE
14 years 8 months ago
2007
IEEE
Crosstalk noise in the clock network of digital circuits is often detected late in the design cycle, sometimes as late as after first silicon. It is therefore necessary to fix cros...