1102 search results - page 116 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
ISESE
2003
IEEE
14 years 2 months ago
2003
IEEE
A software development project coordinates work by using work items that represent customer, tester, and developer found defects, enhancements, and new features. We set out to fac...
ATAL
2011
Springer
12 years 9 months ago
2011
Springer
Recent rise in maritime piracy prompts the search for novel techniques for addressing the problem. We therefore developed AgentC, a prototype system that demonstrates how agent-ba...
IFM
2009
Springer
14 years 3 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
JMLR
2010
13 years 3 months ago
2010
We consider the problem of reducing the dimensionality of labeled data for classification. Unfortunately, the optimal approach of finding the low-dimensional projection with minim...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...