Sciweavers

12052 search results - page 688 / 2411
» computing 2010
Sort
View
208
Voted
PPL
2010
117views more  PPL 2010»
15 years 2 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ENDM
2010
86views more  ENDM 2010»
15 years 7 months ago
Mathematical programming based debugging
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
Leo Liberti, Stéphane Le Roux, Jeremy Lecon...
210
Voted
ORL
2010
167views more  ORL 2010»
15 years 2 months ago
An embedded Markov chain approach to stock rationing
Rationing is an inventory policy that allows prioritization of demand classes. It enables the inventory system to provide higher service levels for critical demand classes. In thi...
Mehmet Murat Fadiloglu, Önder Bulut
CCGRID
2010
IEEE
15 years 8 months ago
An Effective Architecture for Automated Appliance Management System Applying Ontology-Based Cloud Discovery
Cloud computing is a computing paradigm which allows access of computing elements and storages on-demand over the Internet. Virtual Appliances, pre-configured, readyto-run applicat...
Amir Vahid Dastjerdi, Sayed Gholam Hassan Tabataba...
DAM
2010
86views more  DAM 2010»
15 years 7 months ago
Minimum fill-in and treewidth of split+ke and split+kv graphs
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...
Federico Mancini