Sciweavers

6740 search results - page 25 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
VLDB
1990
ACM
179views Database» more  VLDB 1990»
13 years 11 months ago
On Indexing Line Segments
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
H. V. Jagadish
AI
1998
Springer
13 years 7 months ago
Utility-Based On-Line Exploration for Repeated Navigation in an Embedded Graph
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
Shlomo Argamon-Engelson, Sarit Kraus, Sigalit Sina
EOR
2006
104views more  EOR 2006»
13 years 7 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve
ORL
2008
66views more  ORL 2008»
13 years 7 months ago
Profit-based latency problems on the line
We consider a latency problem with a profit pi for each client. When serving a client, a revenue of pi -t is collected. The goal is to find routes for the servers such that total ...
Sofie Coene, Frits C. R. Spieksma
CPM
2001
Springer
130views Combinatorics» more  CPM 2001»
14 years 3 days ago
On-Line Construction of Compact Directed Acyclic Word Graphs
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohar...