Sciweavers

8413 search results - page 188 / 1683
» Ordering Problem Subgoals
Sort
View
AAAI
2008
15 years 3 months ago
Planning with Problems Requiring Temporal Coordination
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
93
Voted
COR
2010
99views more  COR 2010»
15 years 23 days ago
A new heuristic to solve the one-warehouse N-retailer problem
We deal with a multi-echelon inventory system in which one warehouse supplies an item to multiple retailers. Customer demand arrives at each retailer at a constant rate. The retai...
Beatriz Abdul-Jalbar, Anders Segerstedt, Joaquin S...
125
Voted
SERP
2010
14 years 10 months ago
Role Explosion: Acknowledging the Problem
- In large enterprises subject to constant employee turnover and challenging security policies, the administration of Role-based Access Control (RBAC) is a daunting task that is of...
Aaron Elliott, Scott Knight
ESA
2007
Springer
143views Algorithms» more  ESA 2007»
15 years 6 months ago
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
Chien-Chung Huang
105
Voted
CORR
2010
Springer
190views Education» more  CORR 2010»
15 years 23 days ago
Stable marriage problems with quantitative preferences
The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a problem ha...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...