Sciweavers

128 search results - page 22 / 26
» Ensuring Termination by Typability
Sort
View
JAIR
2008
110views more  JAIR 2008»
13 years 7 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
CORR
2008
Springer
78views Education» more  CORR 2008»
13 years 7 months ago
Wireless Secrecy in Cellular Systems with Infrastructure--Aided Cooperation
In cellular systems, confidentiality of uplink transmission with respect to eavesdropping terminals can be ensured by creating intentional interference via scheduling of concurren...
Petar Popovski, Osvaldo Simeone
LOGCOM
2010
136views more  LOGCOM 2010»
13 years 5 months ago
Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic
Bi-intuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But ...
Rajeev Goré, Linda Postniece
MOBISYS
2007
ACM
14 years 7 months ago
Energy-efficient multi-hop medical sensor networking
Abstract-- Wireless sensor networks represent a key technology enabler for enhanced health care and assisted living systems. Recent standardization efforts to ensure compatibility ...
Antonio G. Ruzzelli, Raja Jurdak, Gregory M. P. O'...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 4 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...