Sciweavers

1707 search results - page 133 / 342
» Early Integer Programming
Sort
View
110
Voted
AMC
2008
206views more  AMC 2008»
14 years 11 months ago
Global-best harmony search
ct 8 Harmony search (HS) is a new meta-heuristic optimization method imitating the music improvisation process where 9 musicians improvise their instruments' pitches searching...
Mahamed G. H. Omran, Mehrdad Mahdavi
102
Voted
NETWORKS
2010
14 years 11 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
ETS
2009
IEEE
117views Hardware» more  ETS 2009»
14 years 10 months ago
A Two Phase Approach for Minimal Diagnostic Test Set Generation
We optimize the full-response diagnostic fault dictionary from a given test set. The smallest set of vectors is selected without loss of diagnostic resolution of the given test se...
Mohammed Ashfaq Shukoor, Vishwani D. Agrawal
172
Voted
COR
2011
14 years 7 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
14 years 4 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid