Sciweavers

1460 search results - page 267 / 292
» Very Lightweight Requirements Modeling
Sort
View
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
14 years 12 days ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
CIDR
2003
106views Algorithms» more  CIDR 2003»
13 years 10 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
SERP
2003
13 years 10 months ago
A Process for BDI Agent-Based Software Construction
Agent-based programming comes us as a next generation programming paradigm. However, we have not been ready yet to fully use it without having sound and concrete software engineer...
Chang-Hyun Jo, Jeffery M. Einhorn
UAI
2003
13 years 10 months ago
Marginalizing Out Future Passengers in Group Elevator Control
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprising...
Daniel Nikovski, Matthew Brand
WSC
1998
13 years 10 months ago
Implementing the Theory of Constraints Philosophy in Highly Reentrant Systems
A significant challenge in implementing the Theory of Constraints in the semiconductor industry is the complex and reentrant nature of the manufacturing process. Managing a constr...
Clay Rippenhagen, Shekar Krishnaswamy