Sciweavers

2398 search results - page 402 / 480
» Constraint Programming and Graph Algorithms
Sort
View
120
Voted
MOBIHOC
2006
ACM
15 years 8 months ago
Wakeup scheduling in wireless sensor networks
A large number of practical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation command...
Abtin Keshavarzian, Huang Lee, Lakshmi Venkatraman
AIPS
2009
15 years 3 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
IOR
2007
106views more  IOR 2007»
15 years 2 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
DM
2006
128views more  DM 2006»
15 years 2 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
CIKM
2011
Springer
14 years 2 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han