Sciweavers

2313 search results - page 165 / 463
» On Heuristic Time Hierarchies
Sort
View
COR
2008
88views more  COR 2008»
15 years 6 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
ECCC
2006
97views more  ECCC 2006»
15 years 6 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
Frank Neumann, Carsten Witt
IJWET
2008
81views more  IJWET 2008»
15 years 6 months ago
XFIS: an XML filtering system based on string representation and matching
: Information-filtering systems constitute a critical component of modern information-seeking applications. As the number of users grows and the amount of information available bec...
Panagiotis Antonellis, Christos Makris
COMCOM
2007
111views more  COMCOM 2007»
15 years 6 months ago
An argument for simple embedded ACL optimisation
The difficulty of efficiently reordering the rules in an Access Control List is considered and the essential optimisation problem formulated. The complexity of exact and sophistic...
Vic Grout, John Davies, John McGinn
CSDA
2007
109views more  CSDA 2007»
15 years 6 months ago
Improving the computation of censored quantile regressions
Abstract. Censored quantile regressions (CQR) are a valuable tool in economics and engineering. The computation of estimators is highly complex and the performance of standard meth...
Bernd Fitzenberger, Peter Winker