Sciweavers

18090 search results - page 84 / 3618
» Computing by Only Observing
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 10 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
APSEC
2004
IEEE
15 years 10 months ago
A Dual-Mode Exerciser for a Collaborative Computing Environment
Computer-supported cooperative work (CSCW) supports groups with communication and coordination during the execution of their activities. It allows physically dispersed teams to en...
Chien-Min Wang, Shyh-Fong Hong, Shun-Te Wang, Hsi-...
TKDE
2011
168views more  TKDE 2011»
15 years 1 months ago
On Computing Farthest Dominated Locations
—In reality, spatial objects (e.g., hotels) not only have spatial locations but also have quality attributes (e.g., price, star). An object p is said to dominate another one p , ...
Hua Lu, Man Lung Yiu
AGILE
2009
Springer
264views GIS» more  AGILE 2009»
16 years 23 days ago
Three-Valued 9-Intersection for Deriving Possible Topological Relations from Incomplete Observations
Topological relations, which concern how two objects intersect, are one of the most fundamental and well-studied spatial relations. Typically, topological relations are distinguis...
Yohei Kurata
AAAI
2006
15 years 7 months ago
Learning Partially Observable Action Schemas
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
Dafna Shahaf, Eyal Amir