Sciweavers

559 search results - page 106 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
CP
2006
Springer
13 years 11 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann
PUC
2007
154views more  PUC 2007»
13 years 7 months ago
Point-of-capture archiving and editing of personal experiences from a mobile device
Personal experience computing is an emerging research area in computing support for capturing, archiving, editing, and utilizing of digital personal experiences. This paper presen...
Chon-in Wu, Chao-ming Teng, Yi-Chao Chen, Tung-yun...
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 7 months ago
Slow Adaptive OFDMA Systems Through Chance Constrained Programming
Adaptive orthogonal frequency division multiple access (OFDMA) has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wire...
William Weiliang Li, Ying Jun Zhang, Anthony Man-C...
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 8 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
AIPS
2009
13 years 8 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...