Sciweavers

2845 search results - page 423 / 569
» Constraints over Ontologies
Sort
View
CP
2007
Springer
14 years 3 months ago
Min-Domain Ordering for Asynchronous Backtracking
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
Roie Zivan, Moshe Zazone, Amnon Meisels
CSCLP
2007
Springer
14 years 3 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
CSR
2007
Springer
14 years 3 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
DCOSS
2007
Springer
14 years 3 months ago
Localization for Anchoritic Sensor Networks
We introduce a class of anchoritic sensor networks, where communications between sensor nodes are undesirable or infeasible due to, e.g., harsh environments, energy constraints, or...
Yuliy M. Baryshnikov, Jian Tan
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
14 years 3 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel