Sciweavers

780 search results - page 98 / 156
» Reasoning about sets using redescription mining
Sort
View
CP
2004
Springer
15 years 7 months ago
Unary Resource Constraint with Optional Activities
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
Petr Vilím, Roman Barták, Ondrej Cep...
109
Voted
LOBJET
2008
104views more  LOBJET 2008»
15 years 3 months ago
Une approche formelle de la reconfiguration dynamique
Self-adapting software adapts its behavior in an autonomic way, by dynamically adding, suppressing and recomposing components, and by the use of computational reflection. One way t...
M. Simonot, M. Aponte
136
Voted
ICCAD
2010
IEEE
186views Hardware» more  ICCAD 2010»
15 years 1 months ago
Efficient state space exploration: Interleaving stateless and state-based model checking
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
Malay K. Ganai, Chao Wang, Weihong Li
166
Voted
CVPR
2011
IEEE
14 years 12 months ago
Multi-agent event recognition in structured scenarios
We present a framework for the automatic recognition of complex multi-agent events in settings where structure is imposed by rules that agents must follow while performing activit...
Vlad Morariu, Larry Davis
121
Voted
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 4 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos