Sciweavers

1397 search results - page 272 / 280
» Algorithms for Proximity Problems on Colored Point Sets
Sort
View
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 8 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
ICC
2008
IEEE
115views Communications» more  ICC 2008»
14 years 2 months ago
Oblivious Routing for Wireless Mesh Networks
—Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing pl...
Jonathan Wellons, Yuan Xue
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 9 months ago
Context-dependent predictions and cognitive arm control with XCSF
While John Holland has always envisioned learning classifier systems (LCSs) as cognitive systems, most work on LCSs has focused on classification, datamining, and function appro...
Martin V. Butz, Oliver Herbort
SIGIR
2010
ACM
13 years 3 months ago
Personalised video retrieval: application of implicit feedback and semantic user profiles
TION ABSTRACT Personalised Video Retrieval: Application of Implicit Feedback and Semantic User Profiles Frank Hopfgartner University of Glasgow Glasgow G12 8QQ United Kingdom A ch...
Frank Hopfgartner
MOBIHOC
2009
ACM
14 years 9 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu