Sciweavers

5055 search results - page 37 / 1011
» Relative Timing
Sort
View
TGC
2007
Springer
14 years 2 months ago
Relational Analysis for Delivery of Services
Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that c...
Flemming Nielson, Hanne Riis Nielson, Jörg Ba...
ICOST
2011
Springer
12 years 12 months ago
Using Association Rule Mining to Discover Temporal Relations of Daily Activities
The increasing aging population has inspired many machine learning researchers to find innovative solutions for assisted living. A problem often encountered in assisted living set...
Ehsan Nazerfard, Parisa Rashidi, Diane J. Cook
ECML
2006
Springer
14 years 5 days ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
CP
2009
Springer
14 years 9 months ago
Same-Relation Constraints
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
Christopher Jefferson, Karen E. Petrie, Meinolf Se...
COCO
2001
Springer
107views Algorithms» more  COCO 2001»
14 years 1 months ago
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...