Sciweavers

3875 search results - page 767 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
CPHYSICS
2004
87views more  CPHYSICS 2004»
14 years 9 months ago
Vlasov simulations on an adaptive phase-space grid
We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained throu...
Michael Gutnic, Matthieu Haefele, I. Paun, Eric So...
ICALP
2009
Springer
15 years 10 months ago
Elimination Graphs
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
Yuli Ye, Allan Borodin
EMSOFT
2007
Springer
15 years 3 months ago
Optimal task placement to improve cache performance
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
Gernot Gebhard, Sebastian Altmeyer
WABI
2007
Springer
102views Bioinformatics» more  WABI 2007»
15 years 3 months ago
Homology Search with Fragmented Nucleic Acid Sequence Patterns
The comprehensive annotation of non-coding RNAs in newly sequenced genomes is still a largely unsolved problem because many functional RNAs exhibit not only poorly conserved sequen...
Axel Mosig, Julian J.-L. Chen, Peter F. Stadler
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm