Sciweavers

1220 search results - page 32 / 244
» Minimal Interval Completions
Sort
View
JAR
2008
81views more  JAR 2008»
13 years 9 months ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah
AIPS
2009
13 years 10 months ago
Minimal Sufficient Explanations for Factored Markov Decision Processes
Explaining policies of Markov Decision Processes (MDPs) is complicated due to their probabilistic and sequential nature. We present a technique to explain policies for factored MD...
Omar Zia Khan, Pascal Poupart, James P. Black
LCN
2003
IEEE
14 years 2 months ago
Performance Analysis of IP Paging Protocol in IEEE 802.11 Networks
Recently, IEEE 802.11 wireless networks have been widely deployed in public areas for mobile Internet services. In the public wireless LAN systems, paging function is necessary to...
Sangheon Pack, Ved Kafle, Yanghee Choi
ESWS
2007
Springer
14 years 3 months ago
Minimal Deductive Systems for RDF
Abstract. This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler lang...
Sergio Muñoz, Jorge Pérez, Claudio G...
AAAI
2008
13 years 12 months ago
Minimizing Disk I/O in Two-Bit Breadth-First Search
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
Richard E. Korf