Sciweavers

1972 search results - page 334 / 395
» connection 2008
Sort
View
CORR
2008
Springer
86views Education» more  CORR 2008»
14 years 9 months ago
Dynamic System Adaptation by Constraint Orchestration
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
Luuk Groenewegen, Erik P. de Vink
CORR
2008
Springer
111views Education» more  CORR 2008»
14 years 9 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
CORR
2008
Springer
71views Education» more  CORR 2008»
14 years 9 months ago
Asteroids in rooted and directed path graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
Kathie Cameron, Chính T. Hoàng, Benj...
MIS
2008
Springer
130views Multimedia» more  MIS 2008»
14 years 9 months ago
Adaptive and fuzzy approaches for nodes affinity management in wireless ad-hoc networks
In most of the ad-hoc routing protocols, a static link lifetime (LL) is used for a newly discovered neighbors. Though this works well for networks with fixed infrastructures, it is...
Essam Natsheh, Tat Chee Wan
ML
2008
ACM
135views Machine Learning» more  ML 2008»
14 years 9 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget