77 search results - page 8 / 16 » Exploring adjacency in floorplanning |
SARA
2009
Springer
14 years 5 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
CHI
2002
ACM
14 years 11 months ago
2002
ACM
Breakdown analysis involves decomposing data into subgroups to allow for comparison and identification of problem areas. Good analysis requires the ability to group data based on ...
CISS
2008
IEEE
14 years 5 months ago
2008
IEEE
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
IJCNLP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We explore the use of a partially annotated corpus to build a dependency parser for Japanese. We examine two types of partially annotated corpora. It is found that a pars...