Sciweavers

4781 search results - page 372 / 957
» Complexity at large
Sort
View
132
Voted
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 8 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
JSW
2006
98views more  JSW 2006»
15 years 4 months ago
A Jxta Based Asynchronous Peer-to-Peer Implementation of Genetic Programming
Abstract-- Solving complex real-world problems using evolutionary computation is a CPU time-consuming task that requires a large amount of computational resources. Peerto-Peer (P2P...
Gianluigi Folino, Agostino Forestiero, Giandomenic...
ICASSP
2011
IEEE
14 years 8 months ago
Cooperative sensing in cognitive networks under malicious attack
Abstract—This paper considers cooperative sensing in cognitive networks under Spectrum Sensing Data Falsification attack (SSDF) in which malicious users can intentionally send f...
Mai Abdelhakim, Lei Zhang, Jian Ren, Tongtong Li
NGITS
1999
Springer
15 years 8 months ago
From Object-Process Diagrams to a Natural Object-Process Language
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
Mor Peleg, Dov Dori
130
Voted
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
15 years 10 months ago
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
Artur Alves Pessoa, Marcus Poggi de Aragão,...