Sciweavers

9842 search results - page 1387 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ECOOP
2004
Springer
16 years 17 days ago
Parametric Aspects: A Proposal
Abstract. Aspect-Oriented Software Development (AOSD) provides better design solutions to problems where Object Oriented Development produces tangled and scattered designs. Neverth...
Jordi Alvarez Canal
ICCSA
2004
Springer
16 years 17 days ago
A Comparison Study of Metaheuristic Techniques for Providing QoS to Avatars in DVE Systems
Abstract. Network-server architecture has become a de-facto standard for Distributed Virtual Environment (DVE) systems. In these systems, a large set of remote users share a 3D vir...
Pedro Morillo, Juan M. Orduña, Marcos Fern&...
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
16 years 17 days ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
IWPEC
2004
Springer
16 years 16 days ago
Chordless Paths Through Three Vertices
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
Robert Haas, Michael Hoffmann
NMR
2004
Springer
16 years 16 days ago
Plan reversals for recovery in execution monitoring
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...
Thomas Eiter, Esra Erdem, Wolfgang Faber
« Prev « First page 1387 / 1969 Last » Next »