Sciweavers

1609 search results - page 20 / 322
» Problem Structure and Dependable Architecture
Sort
View
AAAI
2008
15 years 8 months ago
Efficiently Exploiting Dependencies in Local Search for SAT
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
Duc Nghia Pham, John Thornton, Abdul Sattar
CALC
2001
Springer
161views Cryptology» more  CALC 2001»
15 years 10 months ago
The Shortest Vector Problem in Lattices with Many Cycles
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...
Mårten Trolin
GECCO
2003
Springer
116views Optimization» more  GECCO 2003»
15 years 11 months ago
A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
Dong-il Seo, Byung Ro Moon
ICCS
2005
Springer
15 years 11 months ago
The Development of Dependable and Survivable Grids
Abstract. Grids should not just be facilitating advances in science and engineering; rather they should also be making an impact on our daily lives by enabling sophisticated applic...
Andrew S. Grimshaw, Marty A. Humphrey, John C. Kni...
E4MAS
2004
Springer
15 years 11 months ago
A Spatially Dependent Communication Model for Ubiquitous Systems
Models and conceptualizations are necessary to understand and design ubiquitous systems that are context–aware not just from a technological point of view. The current technologi...
Stefania Bandini, Sara Manzoni, Giuseppe Vizzari