15033 search results - page 337 / 3007 » Complexity Theory and Algorithms |
170
click to vote
EOR
2008
15 years 6 months ago
2008
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
172
click to vote
AAECC
2002
Springer
15 years 6 months ago
2002
Springer
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
231
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
140
Voted
MOC
1998
15 years 6 months ago
1998
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
205
Voted
SIGGRAPH
1997
ACM
15 years 11 months ago
1997
ACM
Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions. Accurate lighting calculations are typically perfo...