Sciweavers

1920 search results - page 187 / 384
» The Complexity of the A B C Problem
Sort
View
FGCS
2008
99views more  FGCS 2008»
15 years 6 months ago
An innovative workflow mapping mechanism for Grids in the frame of Quality of Service
The advent of Grid environments made feasible the solution of computational intensive problems in a reliable and cost-effective way. As workflow systems carry out more complex and...
Dimosthenis Kyriazis, Konstantinos Tserpes, Andrea...
CEC
2008
IEEE
16 years 29 days ago
Divide and conquer evolutionary TSP solution for vehicle path planning
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
Ryan J. Meuth, Donald C. Wunsch
ICALT
2008
IEEE
16 years 28 days ago
A Framework for Semantic Group Formation
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...
Asma Ounnas, Hugh C. Davis, David E. Millard
CP
2005
Springer
16 years 23 hour ago
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...
CP
2004
Springer
15 years 12 months ago
Backtrack-Free Search for Real-Time Constraint Satisfaction
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
J. Christopher Beck, Tom Carchrae, Eugene C. Freud...