14518 search results - page 1 / 2904 » Two Problems for Sophistication |
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—The design of computer and communication systems has been based, for decades, on the fundamental assumption that the objective of all users is to improve their own performance. ...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
EWHCI
1993
13 years 8 months ago
1993
One of the new design goals in Human Computer Interaction is to extend the sensory-motor capabilities of computer systems to better match the natural communication means of human b...
PDCAT
2005
Springer
13 years 10 months ago
2005
Springer
This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...