16513 search results - page 418 / 3303 » Numerical Analysis Methods |
176
Voted
AIPS
2006
15 years 8 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
157
click to vote
CSC
2006
15 years 8 months ago
2006
- We develop a numerical scheme for computing the solution of a generalized version of Fisher's equation. The main idea is to use a modi ed Crank-Nicolson method in order to c...
151
click to vote
ESANN
2004
15 years 8 months ago
2004
In many applications, high dimensional input data can be considered as sampled functions. We show in this paper how to use this prior knowledge to implement functional preprocessin...
164
click to vote
RIVF
2003
15 years 8 months ago
2003
—This paper addresses the simulation of the dynamics of complex systems by using hierarchical graph and multi-agent system. A complex system is composed of numerous interacting p...
166
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...