Sciweavers

6894 search results - page 350 / 1379
» Generation Problems
Sort
View
CEC
2009
IEEE
16 years 1 months ago
Examination timetabling using late acceptance hyper-heuristics
— A hyperheuristic is a high level problem solving methodology that performs a search over the space generated by a set of low level heuristics. One of the hyperheuristic framewo...
Ender Özcan, Yuri Bykov, Murat Birben, Edmund...
ICIP
2005
IEEE
16 years 8 months ago
Countering oversegmentation in partitioning-based connectivities
A new theoretical development is presented for handling the over-segmentation problem in partitioning-based connected openings. The definition we propose treats singletons generat...
Georgios K. Ouzounis, Michael H. F. Wilkinson
VISUALIZATION
1992
IEEE
15 years 10 months ago
Generalized Focal Surfaces: A New Method for Surface Interrogation
The generation of smooth surfaces from a mesh of three-dimensional data points is an important problem in geometric modeling. Apart from the pure construction of these curves and ...
Hans Hagen, Stefanie Hahmann
CCO
2001
Springer
256views Combinatorics» more  CCO 2001»
15 years 11 months ago
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
Alexander Martin
SAT
2010
Springer
152views Hardware» more  SAT 2010»
15 years 5 months ago
Simple but Hard Mixed Horn Formulas
Abstract. We study simple classes of mixed Horn formulas, in which the structure of the Horn part is drastically constrained. We show that the SAT problem for formulas in these cla...
Gayathri Namasivayam, Miroslaw Truszczynski