Sciweavers

492 search results - page 38 / 99
» Perfect Matching Preservers
Sort
View
P2P
2002
IEEE
114views Communications» more  P2P 2002»
15 years 11 months ago
Integrating Peer-to-Peer Networking and Computing in the AgentScape Framework
The combination of peer-to-peer networking and agentbased computing seems to be a perfect match. Agents are cooperative and communication oriented, while peerto-peer networks typi...
Benno J. Overeinder, Etienne Posthumus, Frances M....
EUROGP
2000
Springer
15 years 10 months ago
Seeding Genetic Programming Populations
We show genetic programming (GP) populations can evolve under the influence of a Pareto multi-objective fitness and program size selection scheme, from "perfect" programs...
William B. Langdon, Peter Nordin
MPC
2000
Springer
105views Mathematics» more  MPC 2000»
15 years 10 months ago
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
Sergei M. Abramov, Robert Glück
JCT
2006
102views more  JCT 2006»
15 years 6 months ago
Minimal bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...
Serguei Norine, Robin Thomas
SIAMCOMP
2000
99views more  SIAMCOMP 2000»
15 years 6 months ago
Squarish k-d Trees
We modify the k-d tree on [0, 1]d by always cutting the longest edge instead of rotating through the coordinates. This modification makes the expected time behavior of lowerdimensi...
Luc Devroye, Jean Jabbour, Carlos Zamora-Cura