Sciweavers

1403 search results - page 131 / 281
» About Approximations of Exponentials
Sort
View
AIPS
1996
15 years 6 months ago
Least-Commitment Action Selection
The principle of least commitment was embraced early in planning research. Hierarchical task networks (HTNs)reason about high-level tasks without committing to specific low-level ...
Marc Friedman, Daniel S. Weld
AIPS
2009
15 years 5 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
CAGD
2008
98views more  CAGD 2008»
15 years 4 months ago
Exact evaluation of limits and tangents for non-polynomial subdivision schemes
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision and its associated tangent vectors on a uniform grid of any size. Other exact eval...
S. Schaefer, J. Warren
AI
2006
Springer
15 years 4 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne
ASC
2004
15 years 4 months ago
Extracting rules from trained neural network using GA for managing E-business
Theabilitytointelligentlycollect,manageandanalyzeinformationaboutcustomersandsellersisakeysourceofcompetitive advantage for an e-business. This ability provides an opportunity to ...
Atta Ebrahim E. ElAlfi, R. Haque, M. Esmel ElAlami