Sciweavers

14649 search results - page 59 / 2930
» Principles of problem solving
Sort
View
IPPS
2003
IEEE
14 years 4 months ago
A GRASP-Based Algorithm for Solving DVE Partitioning Problem
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
Pedro Morillo, Marcos Fernández
ICCSA
2003
Springer
14 years 4 months ago
A Comparison Study of Modern Heuristics for Solving the Partitioning Problem in Distributed Virtual Environment Systems
Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environment (DVE) systems very common nowadays. However, there are...
Pedro Morillo, Marcos Fernández, Juan M. Or...
ECAI
2000
Springer
14 years 2 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
AIPS
1994
14 years 14 days ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald
COR
2008
88views more  COR 2008»
13 years 11 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...