4539 search results - page 774 / 908 » Approaches to Compute Workflow Complexity |
166
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
146
click to vote
SMA
1995
ACM
15 years 8 months ago
1995
ACM
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
138
click to vote
AAAI
2007
15 years 6 months ago
2007
Much of artificial intelligence research is focused on devising optimal solutions for challenging and well-defined but highly constrained problems. However, as we begin creating...
146
click to vote
DLOG
2007
15 years 6 months ago
2007
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
159
click to vote
EDBT
2010
ACM
15 years 6 months ago
2010
ACM
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...