Sciweavers

2584 search results - page 314 / 517
» On the Forward Checking Algorithm
Sort
View
102
Voted
SIGSOFT
2005
ACM
16 years 3 months ago
Permissive interfaces
A modular program analysis considers components independently and provides succinct summaries for each component, which can be used when checking the rest of the system. Consider ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar
JAIR
2000
96views more  JAIR 2000»
15 years 2 months ago
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
Rune M. Jensen, Manuela M. Veloso
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
16 years 3 months ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...
115
Voted
MOBIHOC
2007
ACM
16 years 2 months ago
On exploiting asymmetric wireless links via one-way estimation
A substantial percentage of links in wireless networks, especially low-power ones, is asymmetric. For the low-quality direction of asymmetric links, we observe based on testbed ex...
Lifeng Sang, Anish Arora, Hongwei Zhang
153
Voted
FOCS
2008
IEEE
15 years 9 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...