315 search results - page 32 / 63 » A new heuristic to solve the one-warehouse N-retailer proble... |
108
click to vote
AAAI
1994
14 years 11 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
ATAL
2003
Springer
15 years 2 months ago
2003
Springer
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
ISLPED
1999
ACM
15 years 2 months ago
1999
ACM
-- The goal of a dynamic power management policy is to reduce the power consumption of an electronic system by putting system components into different states, each representing ce...
HPCN
1995
Springer
15 years 1 months ago
1995
Springer
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
EVOW
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...