Sciweavers

1863 search results - page 74 / 373
» Unifying Theories of Objects
Sort
View
126
Voted
CC
2007
Springer
15 years 8 months ago
Program Refactoring, Program Synthesis, and Model-Driven Development
Program refactoring, feature-based and aspect-oriented software synthesis, and model-driven development are disjoint research areas. However, they are all architectural metaprogram...
Don S. Batory
129
Voted
ICALP
2000
Springer
15 years 7 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée
CP
2008
Springer
15 years 6 months ago
Perfect Constraints Are Tractable
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
András Z. Salamon, Peter G. Jeavons
AI
2002
Springer
15 years 4 months ago
Relaxed Unification - Proposal
Abstract. The traditional unification is strict in the sense that it requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can co...
Tony Abou-Assaleh, Nick Cercone
AROBOTS
2002
121views more  AROBOTS 2002»
15 years 4 months ago
Theory of Mind for a Humanoid Robot
If we are to build human-like robots that can interact naturally with people, our robots must know not only about the properties of objects but also the properties of animate agent...
Brian Scassellati