3320 search results - page 346 / 664 » Heuristics for the Phylogeny Problem |
161
click to vote
IPPS
2005
IEEE
16 years 12 days ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
182
click to vote
WEA
2005
Springer
16 years 9 days ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
175
click to vote
IWQOS
2004
Springer
16 years 5 days ago
2004
Springer
— The Internet still lacks adequate support for QoS applications with real-time requirements. In great part, this is due to the fact that provisioning of end-to-end QoS to traf...
193
Voted
FPL
2003
Springer
16 years 1 days ago
2003
Springer
Local search methods such as WSAT have proven to be successful for solving SAT problems. In this paper, we propose two host-FPGA (Field Programmable Gate Array) co-implementations,...
177
click to vote
GECCO
2003
Springer
16 years 1 days ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...