Sciweavers

2398 search results - page 333 / 480
» Constraint Programming and Graph Algorithms
Sort
View
TVCG
2011
136views more  TVCG 2011»
14 years 12 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
148
Voted
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
15 years 11 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth
SIGSOFT
2005
ACM
16 years 5 months ago
Context- and path-sensitive memory leak detection
We present a context- and path-sensitive algorithm for detecting memory leaks in programs with explicit memory management. Our leak detection algorithm is based on an underlying e...
Yichen Xie, Alexander Aiken
142
Voted
IPPS
2003
IEEE
15 years 10 months ago
Better Real-Time Response for Time-Share Scheduling
As computing systems of all types grow in power and complexity, it is common to want to simultaneously execute processes with different timeliness constraints. Many systems use CP...
Scott A. Banachowski, Scott A. Brandt
HM
2009
Springer
145views Optimization» more  HM 2009»
15 years 9 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...