Sciweavers

1162 search results - page 227 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
14 years 7 days ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 9 months ago
Fitness calculation approach for the switch-case construct in evolutionary testing
A well-designed fitness function is essential to the effectiveness and efficiency of evolutionary testing. Fitness function design has been researched extensively. For fitness ...
Yan Wang, Zhiwen Bai, Miao Zhang, Wen Du, Ying Qin...
SCP
1998
112views more  SCP 1998»
13 years 7 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
13 years 11 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer