Sciweavers

211 search results - page 34 / 43
» Solving Games Without Determinization
Sort
View
SIROCCO
2004
14 years 11 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
Stefan Dobrev, Paola Flocchini, Nicola Santoro
EMSOFT
2004
Springer
15 years 3 months ago
Reactive process networks
Data flow process networks are a good model of computation for streaming multimedia applications incorporating audio, video and/or graphics streams. Process networks are concurre...
Marc Geilen, Twan Basten
SIGGRAPH
2000
ACM
15 years 2 months ago
Surfels: surface elements as rendering primitives
Surface elements (surfels) are a powerful paradigm to efficiently render complex geometric objects at interactive frame rates. Unlike classical surface discretizations, i.e., tri...
Hanspeter Pfister, Matthias Zwicker, Jeroen van Ba...
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
15 years 2 months ago
On the Multiple Gene Duplication Problem
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
14 years 10 months ago
Noncooperative power control and transmission scheduling in wireless collision channels
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...
Ishai Menache, Nahum Shimkin