2635 search results - page 172 / 527 » Computing multihomogeneous resultants using straight-line pr... |
154
click to vote
ICNC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Different mutation operators have been proposed in evolutionary programming. However, each operator may be efficient in solving a subset of problems, but will fail in an...
140
click to vote
MPC
1992
Springer
15 years 7 months ago
1992
Springer
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
129
Voted
NETWORKS
2008
15 years 3 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
115
Voted
ICPP
1994
IEEE
15 years 7 months ago
1994
IEEE
Shared memory in a parallel computer provides prowith the valuable abstraction of a shared address space--through which any part of a computation can access any datum. Although un...
167
Voted
ARGMAS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...