Sciweavers

211 search results - page 38 / 43
» Solving Games Without Determinization
Sort
View
ICC
2011
IEEE
201views Communications» more  ICC 2011»
13 years 10 months ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
82
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
15 years 10 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
15 years 9 days ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
COCOA
2010
Springer
14 years 8 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
ECCV
2000
Springer
16 years 6 days ago
Camera Pose Estimation and Reconstruction from Image Profiles under Circular Motion
Abstract. This paper addresses the problem of motion estimation and reconstruction of 3D models from profiles of an object rotating on a turntable, obtained from a single camera. I...
Paulo R. S. Mendonça, Kwan-Yee Kenneth Wong...