Sciweavers

4524 search results - page 64 / 905
» The Complexity of Global Constraints
Sort
View
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
15 years 11 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
ICPR
2008
IEEE
16 years 23 days ago
Double-edge-model based character stroke extraction from complex backgrounds
Global gray-level thresholding techniques such as Otsu’s method, and local gray-level thresholding techniques such as adaptive thresholding method are powerful in extracting cha...
Jing Yu, Lei Huang, Changping Liu
FPGA
2005
ACM
80views FPGA» more  FPGA 2005»
15 years 12 months ago
Simultaneous timing-driven placement and duplication
Logic duplication is an effective method for improving circuit performance. In this paper we present an algorithm named SPD that performs simultaneous placement and duplication to...
Gang Chen, Jason Cong
ECBS
2002
IEEE
119views Hardware» more  ECBS 2002»
15 years 11 months ago
Managing Complex Temporal Requirements in Real-Time Control Systems
Design and implementation of motion control applications includes the transition from control design to real-time system implementation. To make this transition smooth, the specif...
Kristian Sandström, Christer Norström
AAAI
1994
15 years 7 months ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin