7106 search results - page 77 / 1422 » Restricted Complexity, General Complexity |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
This paper proposes a new algorithm based on the clonal selection principle for the design of spreading codes for DS-CDMA. The algorithm follows a multi-objective approach, genera...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
ICDE
2010
IEEE
14 years 1 months ago
2010
IEEE
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
ISLPED
1998
ACM
13 years 12 months ago
1998
ACM
High-level power estimation is essential for designing complex low-power ICs. However, the lack of flexibility, or restriction to synthesizable code of previously presented high-...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...