Sciweavers

160 search results - page 16 / 32
» Some Theorems on the Algorithmic Approach to Probability The...
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
CCS
2010
ACM
13 years 5 months ago
Adjustable autonomy for cross-domain entitlement decisions
Cross-domain information exchange is a growing problem, as business and governmental organizations increasingly need to integrate their information systems with those of partially...
Jacob Beal, Jonathan Webb, Michael Atighetchi
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
13 years 11 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
APVIS
2011
12 years 7 months ago
Loose capacity-constrained representatives for the qualitative visual analysis in molecular dynamics
Molecular dynamics is a widely used simulation technique to investigate material properties and structural changes under external forces. The availability of more powerful cluster...
Steffen Frey, Thomas Schlömer, Sebastian Grot...
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
14 years 1 months ago
Markov chain models of bare-bones particle swarm optimizers
We apply a novel theoretical approach to better understand the behaviour of different types of bare-bones PSOs. It avoids many common but unrealistic assumptions often used in an...
Riccardo Poli, William B. Langdon