Sciweavers

462 search results - page 64 / 93
» Function Types in Complete Type Inference
Sort
View
AIPS
2010
13 years 7 months ago
A New Approach to Conformant Planning Using CNF*
In this paper, we develop a heuristic, progression based conformant planner, called CNF, which represents belief states by a special type of CNF formulae, called CNF-states. We de...
Son Thanh To, Tran Cao Son, Enrico Pontelli
CORR
2007
Springer
134views Education» more  CORR 2007»
13 years 7 months ago
An Analytical Study of a Structured Overlay in the presence of Dynamic Membership
— In this paper, we present a complete analytical study of dynamic membership (aka churn) in structured peer-to-peer networks. We use a master-equation-based approach, which is u...
Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurel...
IFIPTCS
2010
13 years 5 months ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...
CVPR
2004
IEEE
14 years 9 months ago
Hybrid Textons: Modeling Surfaces with Reflectance and Geometry
The appearance of surface texture as it varies with angular changes of view and illumination is becoming an increasingly important research topic. The bidirectional texture functi...
Jing Wang 0008, Kristin J. Dana
POPL
2010
ACM
14 years 5 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...