3128 search results - page 417 / 626 » Finite element method |
139
click to vote
TPDS
2008
15 years 4 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
153
click to vote
LOGCOM
2007
15 years 4 months ago
2007
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
135
click to vote
COMBINATORICS
2004
15 years 4 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
159
Voted
AAMAS
2000
Springer
15 years 4 months ago
2000
Springer
We adopt the decision-theoretic principle of expected utility maximization as a paradigm for designing autonomous rational agents, and present a framework that uses this paradigm t...
160
Voted
MOC
2002
15 years 4 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...