3946 search results - page 481 / 790 » The computational complexity of choice sets |
224
click to vote
HEURISTICS
2010
15 years 4 months ago
2010
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
200
click to vote
COR
2011
15 years 1 months ago
2011
The task of scheduling communications between satellites and ground control stations is getting more and more critical since an increasing number of satellites must be controlled ...
205
click to vote
ACNS
2011
Springer
14 years 10 months ago
2011
Springer
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
233
click to vote
PPOPP
2011
ACM
14 years 9 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
196
click to vote
ICNP
1998
IEEE
15 years 11 months ago
1998
IEEE
The Internet is rapidly changing from a set of wires and switches that carry packets into a sophisticated infrastructure that delivers a set of complex value-added services to end...