299 search results - page 34 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
121
click to vote
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
FLAIRS
2008
15 years 3 days ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
WCE
2007
14 years 11 months ago
2007
—This paper presents, a two-stage heuristic based procedure for generating part family and machine cell formation in Cellular Manufacturing System. It decreases exceptional eleme...
112
click to vote
SIGGRAPH
1998
ACM
15 years 2 months ago
1998
ACM
Virtual environment research has focused on interactive image generation and has largely ignored acoustic modeling for spatialization of sound. Yet, realistic auditory cues can co...
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...