Sciweavers

28497 search results - page 117 / 5700
» Improving experiences of computation
Sort
View
AAAI
2006
13 years 10 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
WORDS
2003
IEEE
14 years 2 months ago
Improving Dependability of Service Oriented Architectures for Pervasive Computing
Service Oriented Programming - which combines Distributed Object Compunting, Component Based and webbased concepts - has recently emerged as a promising approach to develop dynami...
Domenico Cotroneo, Cristiano di Flora, Stefano Rus...
SIGCSE
2008
ACM
111views Education» more  SIGCSE 2008»
13 years 8 months ago
Improving computer science diversity through summer camps
Summer camps offer a ripe opportunity for increasing computer science diversity. This panel provides several examples of summer camps that specifically recruit from traditionally ...
Dennis P. Groth, Helen H. Hu, Betty Lauer, Hwajung...
IPPS
2005
IEEE
14 years 2 months ago
Improvement of Power-Performance Efficiency for High-End Computing
Left unchecked, the fundamental drive to increase peak performance using tens of thousands of power hungry components will lead to intolerable operating costs and failure rates. R...
Rong Ge, Xizhou Feng, Kirk W. Cameron
CDB
2004
Springer
143views Database» more  CDB 2004»
14 years 2 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry