Sciweavers

1086 search results - page 28 / 218
» Jug measuring: Algorithms and complexity
Sort
View
COCOON
2003
Springer
14 years 4 months ago
Matroid Representation of Clique Complexes
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
IJCGA
2010
155views more  IJCGA 2010»
13 years 9 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
CAV
2007
Springer
157views Hardware» more  CAV 2007»
14 years 5 months ago
An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
Luca de Alfaro, Marco Faella
IMA
1999
Springer
129views Cryptology» more  IMA 1999»
14 years 3 months ago
Some Soft-Decision Decoding Algorithms for Reed-Solomon Codes
Abstract. In this paper we introduce three soft-decision decoding algorithms for Reed-Solomon (RS) codes. We compare them in terms of performance over both the AWGN and Rayleigh Fa...
Stephan Wesemeyer, Peter Sweeney, David R. B. Burg...
CADE
1999
Springer
14 years 3 months ago
A PSpace Algorithm for Graded Modal Logic
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
Stephan Tobies