Sciweavers

COMCOM
2007
84views more  COMCOM 2007»
13 years 11 months ago
A user-focused evaluation of web prefetching algorithms
Web prefetching mechanisms have been proposed to benefit web users by hiding the download latencies. Nevertheless, to the knowledge of the authors, there is no attempt to compare...
Josep Domènech, Ana Pont, Julio Sahuquillo,...
IPL
2008
61views more  IPL 2008»
13 years 11 months ago
Online chasing problems for regular polygons
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa
IPL
2008
114views more  IPL 2008»
13 years 11 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
IPL
2008
98views more  IPL 2008»
13 years 11 months ago
Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
Szymon Grabowski, Kimmo Fredriksson
IPL
2008
146views more  IPL 2008»
13 years 11 months ago
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
Nattapat Attiratanasunthron, Jittat Fakcharoenphol
IPL
2008
111views more  IPL 2008»
13 years 11 months ago
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
Markus Bläser, Thomas Heynen, Bodo Manthey
CN
2007
92views more  CN 2007»
13 years 11 months ago
A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to o...
Jocelyne Elias, Fabio Martignon, Antonio Capone, G...
IEICET
2006
56views more  IEICET 2006»
13 years 11 months ago
Reconfiguration Heuristics for Logical Topologies in Wide-Area WDM Networks
Abstract--We propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to kee...
Hironao Takagi, Yongbing Zhang, Hideaki Takagi
INFORMS
2008
62views more  INFORMS 2008»
13 years 11 months ago
Edge Finding for Cumulative Scheduling
Edge-finding algorithms for cumulative scheduling are at the core of commercial constraint-based schedulers. This paper shows that Nuijten's edge finder for cumulative schedu...
Luc Mercier, Pascal Van Hentenryck
IJSWIS
2008
135views more  IJSWIS 2008»
13 years 11 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...