Sciweavers

798 search results - page 95 / 160
» Interval Methods: An Introduction
Sort
View
GECCO
2003
Springer
115views Optimization» more  GECCO 2003»
14 years 2 months ago
The General Yard Allocation Problem
The General Yard Allocation Problem (GYAP) is a resource allocation problem faced by the Port of Singapore Authority. Here, space allocation for cargo is minimized for all incoming...
Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues
VISUALIZATION
2000
IEEE
14 years 1 months ago
New techniques for topologically correct surface reconstruction
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
Udo Adamy, Joachim Giesen, Matthias John
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
14 years 1 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
COMPSYSTECH
2007
14 years 29 days ago
A refinement model with information granulation focused on difficult to distinguish cases
: The paper proposes a different approach to data modeling. Analogous to the rejection method, where the misclassifications are removed and manually evaluated, we focus here on dif...
Plamena Andreeva, Plamen Andreev, Maya Dimitrova, ...
APNOMS
2006
Springer
14 years 23 days ago
Network-Adaptive QoS Routing Using Local Information
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
Jeongsoo Han