Sciweavers

3656 search results - page 195 / 732
» Compact Location Problems
Sort
View
ICGI
2010
Springer
15 years 4 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
MOBISYS
2006
ACM
16 years 5 months ago
ARIADNE: a dynamic indoor signal map construction and localization system
Location determination of mobile users within a building has attracted much attention lately due to its many applications in mobile networking including network intrusion detectio...
Yiming Ji, Saad Biaz, Santosh Pandey, Prathima Agr...
KES
2005
Springer
15 years 11 months ago
Position Estimation for Goods Tracking System Using Mobile Detectors
Abstract. Determining physical location of indoor objects is one of the key issues in ubiquitous computing. Although there are many proposals to provide physical location tracking,...
Hiroshi Mineno, Kazuo Hida, Miho Mizutani, Naoto M...
WDAS
1998
15 years 7 months ago
A Survey on Counting Networks
In the counting problem, asynchronous concurrent processes repeatedly assign themselves successive values, such as integers or locations in memory. Counting networks are a class o...
Costas Busch, Maurice Herlihy
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 6 months ago
Improved Approximation for Guarding Simple Galleries from the Perimeter
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
James King, David G. Kirkpatrick