Sciweavers

6251 search results - page 841 / 1251
» Randomness, Computability, and Density
Sort
View
CISSE
2008
Springer
15 years 9 months ago
A New Methodology for Self Localization in Wireless Sensor Networks
Localization is the subject matter that has allured the attention of many researchers in the field of wireless sensor network. It is the process of assigning or computing the locat...
Allon Rai, Sangita Ale, Syed Sajjad Rizvi, Aasia R...
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
15 years 9 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin
ESEM
2008
ACM
15 years 9 months ago
Pair programming: what's in it for me?
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, or code. Prior research on pair programming has primari...
Andrew Begel, Nachiappan Nagappan
AAAI
2010
15 years 9 months ago
Truth, Justice, and Cake Cutting
Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of...
Yiling Chen, John Lai, David C. Parkes, Ariel D. P...
GEM
2007
15 years 9 months ago
Initial Population for Genetic Algorithms: A Metric Approach
- Besides the difficulty of the application problem to be solved with Genetic Algorithms (GAs), an additional difficulty arises because the quality of the solution found, or the ...
Pedro A. Diaz-Gomez, Dean F. Hougen