4850 search results - page 614 / 970 » Approximate Data Structures with Applications |
165
click to vote
LATIN
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
169
click to vote
ICC
2000
IEEE
15 years 11 months ago
2000
IEEE
—In this paper, we propose a technique to reduce the number of trellis states in BCJR-type algorithms, i.e., algorithms with a structure similar to that of the well-known algorit...
171
click to vote
ICSE
2000
IEEE-ACM
15 years 10 months ago
2000
IEEE-ACM
This paper presents an algorithm for automatically generating UML statecharts from a collection of UML sequence diagrams. Computer support for this transition between requirements...
169
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
133
click to vote
ANOR
2007
15 years 6 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...