1640 search results - page 149 / 328 » Conditional Independence Trees |
118
Voted
KCAP
2003
ACM
15 years 7 months ago
2003
ACM
Modularity is a key requirement for large ontologies in order to achieve re-use, maintainability, and evolution. Mechanisms for ‘normalisation’ to achieve analogous aims are s...
129
Voted
PPPJ
2003
ACM
15 years 7 months ago
2003
ACM
A simple programmable Java platform-independent distributed computation system has been developed to exploit the free resources on computers linked together by a network. It is a ...
129
Voted
COMPSAC
2002
IEEE
15 years 7 months ago
2002
IEEE
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
120
click to vote
CPAIOR
2010
Springer
15 years 7 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
121
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...