Sciweavers

1925 search results - page 173 / 385
» Theory research at Google
Sort
View
CORR
2008
Springer
113views Education» more  CORR 2008»
15 years 6 months ago
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
Paul Tarau
ALGORITHMICA
2006
77views more  ALGORITHMICA 2006»
15 years 6 months ago
Scalable Parallel Algorithms for FPT Problems
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
IJRR
2008
100views more  IJRR 2008»
15 years 6 months ago
Comparing the Power of Robots
Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing a...
Jason M. O'Kane, Steven M. LaValle
DAM
2007
85views more  DAM 2007»
15 years 6 months ago
Testing primitivity on partial words
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
Francine Blanchet-Sadri, Arundhati R. Anavekar
CCR
2004
62views more  CCR 2004»
15 years 6 months ago
Methodological frameworks for large-scale network analysis and design
This paper emphasizes the need for methodological frameworks for analysis and design of large scale networks which are independent of specific design innovations and their advocac...
Antonis Papachristodoulou, Lun Li, John C. Doyle