Sciweavers

893 search results - page 159 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
PRICAI
2004
Springer
14 years 2 months ago
A Multi-strategy Approach for Catalog Integration
When we have a large amount of information, we usually use categories with a hierarchy, in which all information is assigned. This paper proposes a new method of integrating two ca...
Ryutaro Ichise, Masahiro Hamasaki, Hideaki Takeda
STOC
1999
ACM
106views Algorithms» more  STOC 1999»
14 years 1 months ago
Scheduling in the Dark
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
Jeff Edmonds
ATAL
2010
Springer
13 years 10 months ago
Enumeration and exact design of weighted voting games
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...
Bart de Keijzer, Tomas Klos, Yingqian Zhang
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 2 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
ECAL
1995
Springer
14 years 12 days ago
Contemporary Evolution Strategies
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
Hans-Paul Schwefel, Günter Rudolph