Sciweavers

2168 search results - page 332 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
16 years 16 days ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 12 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
COMPGEOM
2004
ACM
15 years 11 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
HICSS
2003
IEEE
92views Biometrics» more  HICSS 2003»
15 years 11 months ago
Human-Robot Interaction for Intelligent Assisted Viewing During Teleoperation
The Visual Acts theory aims to provide intelligent assistance for camera viewpoint selection during teleoperation. It combines top-down partitioning of a task and bottom-up monito...
Gerard T. McKee, Bernard G. Brooks, Paul S. Schenk...
MOBIHOC
2003
ACM
15 years 11 months ago
Mobility modelling and trajectory prediction for cellular networks with mobile base stations
This paper provides mobility estimation and prediction for a variant of GSM network which resembles an adhoc wireless mobile network where base stations and users are both mobile....
Pubudu N. Pathirana, Andrey V. Savkin, Sanjay Jha