16430 search results - page 580 / 3286 » On Computable Tree Functions |
179
click to vote
ROOM
2000
15 years 8 months ago
2000
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
169
click to vote
WLP
2007
Springer
16 years 1 months ago
2007
Springer
This paper presents the Kiel Curry System (KiCS) for the lazy functional logic language Curry. Its main features beyond other Curry implementations are: flexible search control by...
180
click to vote
P2P
2002
IEEE
16 years 21 hour ago
2002
IEEE
We propose a new p2p network topology that reduces bandwidth consumption and provides complete searches by employing a tree hierarchy of indexing nodes that facilitates the search...
170
click to vote
CCL
1994
Springer
15 years 11 months ago
1994
Springer
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
152
click to vote
NIPS
2003
15 years 8 months ago
2003
We describe a procedure which finds a hierarchical clustering by hillclimbing. The cost function we use is a hierarchical extension of the -means cost; our local moves are tree...