Sciweavers

40 search results - page 5 / 8
» jair 2007
Sort
View
JAIR
2007
113views more  JAIR 2007»
13 years 6 months ago
Chain: A Dynamic Double Auction Framework for Matching Patient Agents
In this paper we present and evaluate a general framework for the design of truthful auctions for matching agents in a dynamic, two-sided market. A single commodity, such as a res...
Jonathan Bredin, David C. Parkes, Quang Duong
JAIR
2007
111views more  JAIR 2007»
13 years 6 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson
JAIR
2007
151views more  JAIR 2007»
13 years 6 months ago
Topic and Role Discovery in Social Networks with Experiments on Enron and Academic Email
Previous work in social network analysis (SNA) has modeled the existence of links from one entity to another, but not the attributes such as language content or topics on those li...
Andrew McCallum, Xuerui Wang, Andrés Corrad...
JAIR
2007
146views more  JAIR 2007»
13 years 6 months ago
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach
Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match c...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
JAIR
2007
141views more  JAIR 2007»
13 years 6 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf