Sciweavers

67 search results - page 4 / 14
» Interactive Route Search in the Presence of Order Constraint...
Sort
View
CADE
2010
Springer
13 years 8 months ago
Analytic Tableaux for Higher-Order Logic with Choice
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
Julian Backes, Chad E. Brown
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
13 years 7 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
WWW
2009
ACM
14 years 8 months ago
Efficient interactive fuzzy keyword search
Traditional information systems return answers after a user submits a complete query. Users often feel "left in the dark" when they have limited knowledge about the unde...
Shengyue Ji, Guoliang Li, Chen Li, Jianhua Feng
SASN
2003
ACM
14 years 27 days ago
Modeling vulnerabilities of ad hoc routing protocols
The purpose of this work is to automate the analysis of ad hoc routing protocols in the presence of attackers. To this end, a formal model of protocol behavior is developed in whi...
Shahan Yang, John S. Baras
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 7 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...