Sciweavers

12783 search results - page 2133 / 2557
» Experimenting with computing
Sort
View
COGSCI
2010
107views more  COGSCI 2010»
15 years 7 months ago
Feature Selection for Inductive Generalization
Judging similarities among objects, events, and experiences is one of the most basic cognitive abilities, allowing us to make predictions and generalizations. The main assumption ...
Na-Yung Yu, Takashi Yamauchi, Huei-Fang Yang, Yen-...
CCR
2008
94views more  CCR 2008»
15 years 7 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
CCR
2008
75views more  CCR 2008»
15 years 7 months ago
Removing exponential backoff from TCP
The well-accepted wisdom is that TCP's exponential backoff mechanism, introduced by Jacobson 20 years ago, is essential for preserving the stability of the Internet. In this ...
Amit Mondal, Aleksandar Kuzmanovic
CE
2008
82views more  CE 2008»
15 years 7 months ago
An empirical study on students' ability to comprehend design patterns
Design patterns have become a widely acknowledged software engineering practice and therefore have been incorporated in the curricula of most computer science departments. This pa...
Alexander Chatzigeorgiou, Nikolaos Tsantalis, Igna...
COR
2010
166views more  COR 2010»
15 years 7 months ago
Variable neighbourhood decomposition search for 0-1 mixed integer programs
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic,...
« Prev « First page 2133 / 2557 Last » Next »