Sciweavers

1618 search results - page 201 / 324
» Testing random number generators
Sort
View
HAIS
2009
Springer
15 years 7 months ago
A Vehicle Routing Problem Solved by Agents
The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths...
Maria Belén Vaquerizo García
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
15 years 6 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres
122
Voted
SOCIALCOM
2010
15 years 11 days ago
Bonding vs. Bridging Social Capital: A Case Study in Twitter
Online communities are connecting large numbers of individuals and generating rich social network data, opening the way for empirical studies of social behavior. In this paper, we ...
Matthew S. Smith, Christophe G. Giraud-Carrier
ICMLA
2004
15 years 3 months ago
Reducing complexity of rule based models via meta mining
Complexity, or in other words compactness, of models generated by rule learners is one of often neglected issues, although it has a profound effect on the success of any project t...
Lukasz A. Kurgan
TVLSI
1998
81views more  TVLSI 1998»
15 years 2 months ago
Maximum power estimation for CMOS circuits using deterministic and statistical approaches
— Excessive instantaneous power consumption may reduce the reliability and performance of VLSI chips. Hence, to synthesize circuits with high reliability, it is imperative to efï...
Chuan-Yu Wang, Kaushik Roy