Sciweavers

135 search results - page 8 / 27
» Efficiently Solving the Fractional Trust Region Problem
Sort
View
CCE
2004
14 years 9 months ago
Efficient short-term scheduling of refinery operations based on a continuous time formulation
The problem addressed in this work is to develop a comprehensive mathematical programming model for the efficient scheduling of oil-refinery operations. Our approach is first to d...
Zhenya Jia, Marianthi G. Ierapetritou
ICIP
2001
IEEE
15 years 11 months ago
A new efficient algorithm for fitting of rectangles and squares
In this paper, we introduce a completely new approach to fitting rectangles and squares to given closed regions using our published ideas in [6], [7], [8]. In these papers, we hav...
Herbert Süße, Klaus Voss
AI
2008
Springer
14 years 9 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
14 years 10 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
CVPR
2007
IEEE
15 years 11 months ago
Robust Click-Point Linking: Matching Visually Dissimilar Local Regions
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
Kazunori Okada, Xiaolei Huang