Sciweavers

14649 search results - page 251 / 2930
» Principles of problem solving
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
ISPD
2006
ACM
68views Hardware» more  ISPD 2006»
16 years 16 days ago
Solving hard instances of floorplacement
Physical Design of modern systems on chip is extremely challenging. Such digital integrated circuits often contain tens of millions of logic gates, intellectual property blocks, e...
Aaron N. Ng, Igor L. Markov, Rajat Aggarwal, Venky...
CASC
2005
Springer
113views Mathematics» more  CASC 2005»
16 years 3 days ago
Real Solving of Bivariate Polynomial Systems
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
Ioannis Z. Emiris, Elias P. Tsigaridas
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
15 years 12 months ago
Simultaneity Matrix for Solving Hierarchically Decomposable Functions
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
Chatchawit Aporntewan, Prabhas Chongstitvatana
SAS
2001
Springer
15 years 11 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller