Sciweavers

5981 search results - page 223 / 1197
» time 2006
Sort
View
ORL
2008
87views more  ORL 2008»
15 years 5 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth
MST
2006
97views more  MST 2006»
15 years 6 months ago
Optimal Implicit Dictionaries over Unbounded Universes
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
Gianni Franceschini, Roberto Grossi
DNA
2006
Springer
129views Bioinformatics» more  DNA 2006»
15 years 10 months ago
P Systems with Active Membranes Characterize PSPACE
P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve i...
Petr Sosík, Alfonso Rodríguez-Pat&oa...
ESA
2006
Springer
112views Algorithms» more  ESA 2006»
15 years 10 months ago
Enumerating Spanning and Connected Subsets in Graphs and Matroids
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
JCNS
2002
72views more  JCNS 2002»
15 years 6 months ago
Noise and the PSTH Response to Current Transients: II. Integrate-and-Fire Model with Slow Recovery and Application to Motoneuron
A generalized version of the integrate-and-fire model is presented that qualitatively reproduces firing rates and membrane trajectories of motoneurons. The description is based on ...
Alix Herrmann, Wulfram Gerstner