Sciweavers

2905 search results - page 75 / 581
» Formal Memetic Algorithms
Sort
View
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
14 years 3 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený
AGTIVE
1999
Springer
14 years 1 months ago
Graph Algorithm Animation with Grrr
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming l...
Peter J. Rodgers, Natalia Vidal
SAS
2004
Springer
14 years 2 months ago
A Polynomial-Time Algorithm for Global Value Numbering
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
Sumit Gulwani, George C. Necula
DAC
1996
ACM
14 years 1 months ago
A Hardware/Software Partitioning Algorithm for Designing Pipelined ASIPs with Least Gate Counts
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
Nguyen-Ngoc Bình, Masaharu Imai, Akichika S...
FORMATS
2007
Springer
14 years 24 days ago
CSL Model Checking Algorithms for Infinite-State Structured Markov Chains
Jackson queueing networks (JQNs) are a very general class of queueing networks that find their application in a variety of settings. The state space of the continuous-time Markov c...
Anne Remke, Boudewijn R. Haverkort