Sciweavers

5864 search results - page 279 / 1173
» Can We Work around Numerical Methods
Sort
View
AIPS
2010
15 years 7 months ago
Forward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
JCP
2006
74views more  JCP 2006»
15 years 7 months ago
Local Boosting of Decision Stumps for Regression and Classification Problems
Numerous data mining problems involve an investigation of associations between features in heterogeneous datasets, where different prediction models can be more suitable for differ...
Sotiris B. Kotsiantis, Dimitris Kanellopoulos, Pan...
TII
2010
113views Education» more  TII 2010»
15 years 1 months ago
An Automated Framework for Formal Verification of Timed Continuous Petri Nets
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
Marius Kloetzer, Cristian Mahulea, Calin Belta, Ma...
JAVA
2001
Springer
15 years 11 months ago
High-performance Java codes for computational fluid dynamics
The computational science community is reluctant to write largescale computationally-intensive applications in Java due to concerns over Java’s poor performance, despite the cla...
Christopher Riley, Siddhartha Chatterjee, Rupak Bi...
ISSAC
1994
Springer
102views Mathematics» more  ISSAC 1994»
15 years 11 months ago
An Application of Symbolic Computation in the Physical Sciences
An example of a problem in the physical sciences is discussed where application of various symbolic computation facilities available in many algebraic computing systems leads to a...
Charles C. Dyer