Sciweavers

5372 search results - page 1063 / 1075
» complexity 2007
Sort
View
CORR
2007
Springer
144views Education» more  CORR 2007»
13 years 9 months ago
Optimization of Information Rate Upper and Lower Bounds for Channels with Memory
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams
CPHYSICS
2007
71views more  CPHYSICS 2007»
13 years 9 months ago
Simulation of n-qubit quantum systems. III. Quantum operations
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
T. Radtke, S. Fritzsche
CTW
2007
95views more  CTW 2007»
13 years 9 months ago
Sensemaking, safety, and cooperative work in the intensive care unit
Abstract Making sense of circumstances and situations is critical to coordinate cooperative work. Especially in process control domains, we may expect that effective and reliable o...
Sara Albolino, Richard Cook, Michael O'Connor
DAM
2007
107views more  DAM 2007»
13 years 9 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
EAAI
2007
154views more  EAAI 2007»
13 years 9 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deï¬...
Ahlem Ben Hassine, Tu Bao Ho
« Prev « First page 1063 / 1075 Last » Next »