Sciweavers

2313 search results - page 268 / 463
» On Heuristic Time Hierarchies
Sort
View
IANDC
2006
86views more  IANDC 2006»
15 years 6 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
IEICET
2006
55views more  IEICET 2006»
15 years 6 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
JUCS
2008
159views more  JUCS 2008»
15 years 6 months ago
Two Step Swarm Intelligence to Solve the Feature Selection Problem
: In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two sta...
Yudel Gómez, Rafael Bello, Amilkar Puris, M...
KES
2006
Springer
15 years 6 months ago
Automatic Detection of SLS Violation Using Knowledge Based Systems
Self-Management of multiservice network domains must include automatic detection of service quality violations in order to perform appropriate and timely responses, fostering the f...
Pedro Alípio, José Neves, Paulo Carv...
KES
2006
Springer
15 years 6 months ago
A computational framework for package planning
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
Yang Xiang, Michael Janzen