Sciweavers

2542 search results - page 129 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
DISOPT
2007
93views more  DISOPT 2007»
15 years 6 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...
GECCO
2009
Springer
118views Optimization» more  GECCO 2009»
16 years 21 days ago
The impact of network topology on self-organizing maps
In this paper, we study instances of complex neural networks, i.e. neural networks with complex topologies. We use Self-Organizing Map neural networks whose neighborhood relations...
Fei Jiang, Hugues Berry, Marc Schoenauer
PODC
2004
ACM
15 years 11 months ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
VLSID
2004
IEEE
125views VLSI» more  VLSID 2004»
16 years 6 months ago
Energy-Optimizing Source Code Transformations for OS-driven Embedded Software
The increasing software content of battery-powered embedded systems has fueled much interest in techniques for developing energyefficient embedded software. Source code transforma...
Yunsi Fei, Srivaths Ravi, Anand Raghunathan, Niraj...
ATAL
2003
Springer
15 years 11 months ago
Optimizing information exchange in cooperative multi-agent systems
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
Claudia V. Goldman, Shlomo Zilberstein