Sciweavers

491 search results - page 19 / 99
» A Fast KNN Algorithm Based on Simulated Annealing
Sort
View
195
Voted
TMC
2012
13 years 5 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...
SIGCOMM
2009
ACM
15 years 10 months ago
A virtual network mapping algorithm based on subgraph isomorphism detection
Assigning the resources of a virtual network to the components of a physical network, called Virtual Network Mapping, plays a central role in network virtualization. Existing appr...
Jens Lischka, Holger Karl
GEM
2010
15 years 1 months ago
Revisiting Genetic Algorithms for the FPGA Placement Problem
In this work, we present a genetic algorithm framework for the FPGA placement problem. This framework is constructed based on previous proposals in this domain. We implement this f...
Peter Jamieson
111
Voted
IWANN
1995
Springer
15 years 7 months ago
Test Pattern Generation for Analog Circuits Using Neural Networks and Evolutive Algorithms
This paper presents a comparative analysis of neural networks, simulated annealing, and genetic algorithms in the determination of input patterns for testing analog circuits. The ...
José Luis Bernier, Juan J. Merelo Guerv&oac...
123
Voted
ISPE
2003
15 years 4 months ago
Negotiation algorithms for collaborative design settings
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...
Mark Klein, Peyman Faratin, Hiroki Sayama, Yaneer ...