Sciweavers

1047 search results - page 123 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
AI
2002
Springer
13 years 7 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
FLAIRS
2004
13 years 9 months ago
Adaptive K-Means Clustering
Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering ...
Sanjiv K. Bhatia
JAMDS
2002
65views more  JAMDS 2002»
13 years 7 months ago
Optimum workforce scheduling under the (14, 21) days-off timetable
Abstract. An efficient optimum solution is presented for a real-life employee daysoff scheduling problem with a three-week cycle. Over a given work cycle, each worker is given 14 s...
Hesham K. Alfares
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
14 years 8 days ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers
APPROX
2009
Springer
105views Algorithms» more  APPROX 2009»
13 years 5 months ago
Real-Time Message Routing and Scheduling
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....
Ronald Koch, Britta Peis, Martin Skutella, Andreas...