Sciweavers

837 search results - page 23 / 168
» Hard combinators
Sort
View
RTA
2004
Springer
15 years 3 months ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema
88
Voted
CORR
2008
Springer
94views Education» more  CORR 2008»
14 years 10 months ago
Decision Support with Belief Functions Theory for Seabed Characterization
The seabed characterization from sonar images is a very hard task because of the produced data and the unknown environment, even for an human expert. In this work we propose an ori...
Arnaud Martin, Isabelle Quidu
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
14 years 10 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
WEBDB
2005
Springer
151views Database» more  WEBDB 2005»
15 years 3 months ago
Constructing Maintainable Semantic Mappings in XQuery
Semantic mapping is one of the important components underlying the data sharing systems. As is known, constructing and maintaining such mappings both are necessary yet extremely h...
Gang Qian, Yisheng Dong
79
Voted
VTC
2008
IEEE
125views Communications» more  VTC 2008»
15 years 4 months ago
Wireless Broadband Services using Smart Caching
— Broadband access for all will be a key functionality in future mobile radio networks. Depending on the length and the characteristic of the radio wave propagation the performan...
Stephan Goebbels