Sciweavers

410 search results - page 46 / 82
» Max and min limiters
Sort
View
ML
2006
ACM
142views Machine Learning» more  ML 2006»
13 years 7 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....
TKDE
2008
234views more  TKDE 2008»
13 years 7 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002
TCS
1998
13 years 7 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...
SIGCSE
2002
ACM
126views Education» more  SIGCSE 2002»
13 years 7 months ago
Design patterns for games
Designing a two-person game involves identifying the game model to compute the best moves, the user interface (the "view") to play the game, and the controller to coordi...
Dung Zung Nguyen, Stephen B. Wong
FORMATS
2010
Springer
13 years 5 months ago
Expected Reachability-Time Games
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
Vojtech Forejt, Marta Z. Kwiatkowska, Gethin Norma...