Sciweavers

2840 search results - page 368 / 568
» Information Retrieval and Artificial Intelligence
Sort
View

Publication
208views
15 years 11 months ago
Tolerable Manipulability in Dynamic Assignment without Money
We study a problem of dynamic allocation without money. Agents have arrivals and departures and strict preferences over items. Strategyproofness requires the use of an arriva...
James Zou, Sujit Gujar, and David C. Parkes
AIME
2001
Springer
15 years 11 months ago
Dynamic Adaptation of Cooperative Agents for MRI Brain Scans Segmentation
To cope with the difficulty of MRI brain scans automatic segmentation, we need to constrain and control the selection and the adjustment of processing tools depending on the local ...
Nathalie Richard, Michel Dojat, Catherine Garbay
164
Voted
IEAAIE
2001
Springer
15 years 11 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
ICTAI
2000
IEEE
15 years 11 months ago
Designing a learning-automata-based controller for client/server systems: a methodology
Abstract— Polling policies have been introduced to simplify the accessing process in client/server systems by a centralized control access scheme. This paper considers a client/s...
Georgios I. Papadimitriou, Athena Vakali, Andreas ...
DIAGRAMS
2000
Springer
15 years 11 months ago
Positive Semantics of Projections in Venn-Euler Diagrams
Venn diagrams and Euler circles have long been used as a means of expressing relationships among sets using visual metaphors such as \disjointness" and \containment" of t...
Joseph Gil, John Howse, Elena Tulchinsky