Sciweavers

2150 search results - page 217 / 430
» On a restricted cross-intersection problem
Sort
View
149
Voted
AAAI
1990
15 years 5 months ago
Exploiting Locality in a TMS
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. ...
Johan de Kleer
COMGEO
2008
ACM
15 years 4 months ago
Covering point sets with two disjoint disks or squares
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red ...
Sergio Cabello, José Miguel Díaz-B&a...
140
Voted
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 4 months ago
Complexity dichotomy on partial grid recognition
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
Vinícius G. P. de Sá, Guilherme Dias...
AHSWN
2006
79views more  AHSWN 2006»
15 years 4 months ago
Re-routing Instability in IEEE 802.11 Multi-hop Ad-hoc Networks
TCP throughput instability is a well-known phenomenon in IEEE 802.11 multi-hop ad-hoc networks. However, we find that this problem is not restricted to TCP traffic only, but also ...
Ping Chung Ng, Soung Chang Liew
ENTCS
2006
103views more  ENTCS 2006»
15 years 4 months ago
Supporting SAT based BMC on Finite Path Models
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...