Sciweavers

14386 search results - page 401 / 2878
» The Chinese Generals Problem
Sort
View
TASE
2010
IEEE
15 years 1 months ago
Sensor Placement for Triangulation-Based Localization
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
Onur Tekdas, Volkan Isler
STACS
2010
Springer
16 years 1 months ago
Log-space Algorithms for Paths and Matchings in k-trees
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
WEBDB
2004
Springer
79views Database» more  WEBDB 2004»
16 years 6 days ago
Scalable Dissemination: What's Hot and What's Not
A major problem in web database applications and on the Internet in general is the scalable delivery of data. One proposed solution for this problem is a hybrid system that uses m...
Jonathan Beaver, Nicholas Morsillo, Kirk Pruhs, Pa...
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
16 years 1 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
15 years 11 months ago
Important moments in systems, control and optimization
— The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence o...
Christopher I. Byrnes, Anders Lindquist