11565 search results - page 1907 / 2313 » Computing Minimal Mappings |
207
click to vote
IFM
2009
Springer
16 years 2 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
226
click to vote
LION
2009
Springer
16 years 2 months ago
2009
Springer
In this paper we present a novel hybrid algorithm, in which ideas from the genetic algorithm and the GRASP metaheuristic are cooperatively used and intertwined to dynamically adjus...
212
click to vote
NOSSDAV
2009
Springer
16 years 2 months ago
2009
Springer
This article proposes a new distributed architecture for update message exchange in massively multi-user virtual environments (MMVE). MMVE applications require delivery of updates...
188
click to vote
SAGT
2009
Springer
16 years 2 months ago
2009
Springer
We study economic means to improve network performance in the well-known game theoretic traffic model due to Wardrop. We introduce two sorts of spam flow - auxiliary and adversari...
248
click to vote
SCIA
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...