Sciweavers

2266 search results - page 71 / 454
» Some Solutions to the Ignoring Problem
Sort
View
CP
2006
Springer
15 years 3 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
JGO
2008
328views more  JGO 2008»
15 years 1 months ago
Singularities of minima: a walk on the wild side of the Calculus of Variations
Abstract I will report on some recent developments concerning the problem of estimating the Hausdorff dimension of the singular sets of solutions to elliptic and variational proble...
Giuseppe Mingione
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
15 years 8 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
EAAI
2007
154views more  EAAI 2007»
15 years 1 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deï¬...
Ahlem Ben Hassine, Tu Bao Ho
AAAI
2010
15 years 2 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto