Sciweavers

4860 search results - page 233 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
BPSC
2009
240views Business» more  BPSC 2009»
13 years 12 months ago
Modelling and Solving Configuration Problems on Business Processes Using a Multi-Level Constraint Satisfaction Approach
Abstract: In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle t levels of...
Wolfgang Runte
CIKM
2009
Springer
14 years 2 months ago
Semantic queries in databases: problems and challenges
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...
Lipyeow Lim, Haixun Wang, Min Wang
GPEM
2008
128views more  GPEM 2008»
13 years 10 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 8 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi
INFOCOM
2010
IEEE
13 years 9 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran