4377 search results - page 228 / 876 » Mass problems and randomness |
235
click to vote
PROMISE
2010
15 years 1 months ago
2010
Background: The main goal of the PROMISE repository is to enable reproducible, and thus verifiable or refutable research. Over time, plenty of data sets became available, especial...
172
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
192
click to vote
COCOA
2009
Springer
16 years 1 months ago
2009
Springer
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
145
click to vote
ISW
2009
Springer
16 years 1 months ago
2009
Springer
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
181
click to vote
PAM
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...