3946 search results - page 662 / 790 » The computational complexity of choice sets |
164
click to vote
GD
2005
Springer
16 years 19 hour ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
191
click to vote
ICSOC
2005
Springer
16 years 7 hour ago
2005
Springer
Abstract. Composite web services can be orchestrated in a decentralized manner by breaking down the original service specification into a set of partitions and executing them on a...
182
click to vote
LACL
2005
Springer
15 years 12 months ago
2005
Springer
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
159
click to vote
WABI
2005
Springer
15 years 12 months ago
2005
Springer
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
186
click to vote
AOSE
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The agent-oriented approach has been successfully applied to the solution of complex problems in dynamic open environments. However, to extend its use to mainstream compu...