567 search results - page 55 / 114 » Decomposing replicable functions |
115
Voted
FOIKS
2008
Springer
15 years 2 months ago
2008
Springer
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
IJCAI
2007
15 years 2 months ago
2007
In many real-world collective decision problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables. The prohibitive size...
SERP
2003
15 years 2 months ago
2003
Current trends suggest future software systems will rely on service-discovery protocols to combine and recombine distributed services dynamically in reaction to changing condition...
89
Voted
EACL
1993
ACL Anthology
15 years 2 months ago
1993
ACL Anthology
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which...
86
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...