Sciweavers

1084 search results - page 54 / 217
» Optimal worm-scanning method using vulnerable-host distribut...
Sort
View
136
Voted
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 8 months ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...
JMM2
2006
141views more  JMM2 2006»
15 years 3 months ago
Optimal Weighting of Landmarks for Face Recognition
A new method named Landmark Model Matching was recently proposed for fully automatic face recognition. It was inspired by Elastic Bunch Graph Matching and Active Shape Model. Landm...
Rajinda Senaratne, Saman K. Halgamuge
132
Voted
CHI
2002
ACM
16 years 4 months ago
Movement model, hits distribution and learning in virtual keyboarding
In a ten-session experiment, six participants practiced typing with an expanding rehearsal method on an optimized virtual keyboard. Based on a large amount of in-situ performance ...
Shumin Zhai, Alison E. Sue, Johnny Accot
AAAI
2006
15 years 5 months ago
Heuristic Search and Information Visualization Methods for School Redistricting
We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a co...
Marie desJardins, Blazej Bulka, Ryan Carr, Andrew ...
157
Voted
TMC
2012
13 years 6 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...