Sciweavers

2542 search results - page 151 / 509
» One step ahead
Sort
View
COMBINATORICA
2010
13 years 7 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel
SIAMNUM
2011
102views more  SIAMNUM 2011»
13 years 13 days ago
Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
Nicola Guglielmi, Christian Lubich
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 3 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
AAAI
1993
13 years 11 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
BMCBI
2010
141views more  BMCBI 2010»
13 years 9 months ago
BioPhysConnectoR: Connecting Sequence Information and Biophysical Models
Background: One of the most challenging aspects of biomolecular systems is the understanding of the coevolution in and among the molecule(s). A complete, theoretical picture of th...
Franziska Hoffgaard, Philipp Weil, Kay Hamacher