Sciweavers

180 search results - page 7 / 36
» heuristics 2011
Sort
View
SBP
2011
Springer
14 years 4 months ago
Ranking Information in Networks
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
Tina Eliassi-Rad, Keith Henderson
ANOR
2011
169views more  ANOR 2011»
14 years 1 months ago
Predetermined intervals for start times of activities in the stochastic project scheduling problem
This paper proposes a new methodology to schedule activities in projects with stochastic activity durations. The main idea is to determine for each activity an interval in which th...
Illana Bendavid, Boaz Golany
MP
2011
14 years 4 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
NFM
2011
335views Formal Methods» more  NFM 2011»
14 years 3 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
103
Voted
JGO
2011
165views more  JGO 2011»
14 years 9 days ago
A biased random-key genetic algorithm for routing and wavelength assignment
The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength...
Thiago F. Noronha, Mauricio G. C. Resende, Celso C...