Sciweavers

2490 search results - page 436 / 498
» The Generalized Theory of Model Preference
Sort
View
SOFSEM
2000
Springer
13 years 11 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
DGO
2008
96views Education» more  DGO 2008»
13 years 9 months ago
Laying the foundations for public participation and value advocacy: interaction design for a large scale urban simulation
Supporting public participation is often a key goal in the design of digital government systems. However, years of work may be required before a complex system, such as the UrbanS...
Batya Friedman, Alan Borning, Janet Davis, Brian T...
ATAL
2010
Springer
13 years 8 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
TEC
2002
81views more  TEC 2002»
13 years 7 months ago
Genetic object recognition using combinations of views
We investigate the application of genetic algorithms (GAs) for recognizing real two-dimensional (2-D) or three-dimensional (3-D) objects from 2-D intensity images, assuming that th...
George Bebis, Evangelos A. Yfantis, Sushil J. Loui...
WWW
2011
ACM
13 years 2 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya