Sciweavers

882 search results - page 45 / 177
» Local Search for Very Large SAT Problems
Sort
View
WETICE
2009
IEEE
15 years 6 months ago
Search Optimizations in Structured Peer-to-Peer Systems
Abstract—DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency ex...
Nuno Lopes, Carlos Baquero
EURODAC
1995
IEEE
136views VHDL» more  EURODAC 1995»
15 years 3 months ago
Computing subsets of equivalence classes for large FSMs
Computing equivalence classes for FSMs has several applications to synthesis and veri cation problems. Symbolic traversal techniques are applicable to medium-small circuits. This ...
Gianpiero Cabodi, Stefano Quer, Paolo Camurati
HM
2007
Springer
155views Optimization» more  HM 2007»
15 years 3 months ago
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
Alexandre R. Duarte, Celso C. Ribeiro, Sebasti&aac...
HEURISTICS
2008
124views more  HEURISTICS 2008»
14 years 12 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
SEMWEB
2010
Springer
14 years 9 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet