5100 search results - page 702 / 1020 » The Linear Complexity of a Graph |
175
click to vote
AAAI
2007
15 years 9 months ago
2007
The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are determinist...
139
click to vote
AAAI
2007
15 years 9 months ago
2007
We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
144
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho alg...
161
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
The impact of parameter variations in integrated analog circuits is usually analyzed by Monte Carlo methods with a high number of simulation runs. Few approaches based on interval ...
189
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
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...