Sciweavers

1358 search results - page 130 / 272
» Proceedings
Sort
View
GECCO
2009
Springer
15 years 8 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
15 years 8 months ago
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
Bryant A. Julstrom
147
Voted
ICC
2007
IEEE
114views Communications» more  ICC 2007»
15 years 8 months ago
Channel-Matched Spreading Codes for the Downlink of MC-CDMA
Abstract-- This paper concerns the multiple access performance of spreading codes used in the downlink of multicarrier code-division multiple-access (MC-CDMA). Complex-valued sprea...
Qinghua Shi, Yong Liang Guan, Choi Look Law
148
Voted
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
15 years 8 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth
AIMSA
2004
Springer
15 years 8 months ago
Identification of Communities of Peers by Trust and Reputation
In: Proceedings of the Eleventh International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA-04), Springer-Verlag LNAI Series. c 2004 We present ...
Alessandro Agostini, Gianluca Moro