Sciweavers

5316 search results - page 121 / 1064
» Which Search Problems Are Random
Sort
View
137
Voted
INFOVIS
2003
IEEE
15 years 8 months ago
Improving Hybrid MDS with Pivot-Based Searching
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
Alistair Morrison, Matthew Chalmers
124
Voted
ACTA
2008
88views more  ACTA 2008»
15 years 2 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
96
Voted
AAAI
2008
15 years 5 months ago
A New Incomplete Method for CSP Inconsistency Checking
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
Belaid Benhamou, Mohamed Réda Saïdi
110
Voted
GECCO
2008
Springer
274views Optimization» more  GECCO 2008»
15 years 4 months ago
Bacterial foraging oriented by particle swarm optimization strategy for PID tuning
Proportional integral derivative (PID) controller tuning is an area of interest for researchers in many disciplines of science and engineering. This paper presents a new algorithm...
Wael Mansour Korani
AIED
2009
Springer
15 years 10 months ago
Will Google destroy western democracy? Bias in policy problem solving
: Democracy requires students to choose policy positions based on evidence, yet confirmation bias prevents them from doing so. As a preliminary step in building a policy reasoning ...
Matthew W. Easterday, Vincent Aleven, Richard Sche...