Sciweavers

336 search results - page 46 / 68
» Consultant-guided search algorithms for the quadratic assign...
Sort
View
LKR
2008
13 years 10 months ago
Identification of MCMC Samples for Clustering
Abstract. For clustering problems, many studies use just MAP assignments to show clustering results instead of using whole samples from a MCMC sampler. This is because it is not st...
Kenichi Kurihara, Tsuyoshi Murata, Taisuke Sato
PACT
1999
Springer
14 years 1 months ago
Parallel Implementation of Constraint Solving
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
Alvaro Ruiz-Andino, Lourdes Araujo, Fernando S&aac...
RTS
2008
134views more  RTS 2008»
13 years 7 months ago
On earliest deadline first scheduling for temporal consistency maintenance
A real-time object is one whose state may become invalid with the passage of time. A temporal validity interval is associated with the object state, and the real-time object is te...
Ming Xiong, Qiong Wang, Krithi Ramamritham
CIKM
2007
Springer
14 years 2 months ago
SLOQUE: slot-based query expansion for complex questions
Searching answers to complex questions is a challenging IR task. In this paper, we examine the use of query templates with semantic slots to formulate slot-based queries. These qu...
Maggy Anastasia Suryanto, Ee-Peng Lim, Aixin Sun, ...
IJCAI
1989
13 years 10 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic