Results 1  10
of
2,615,547
The many faces of Publish/Subscribe
, 2003
"... This paper factors out the common denominator underlying these variants: full decoupling of the communicating entities in time, space, and synchronization. We use these three decoupling dimensions to better identify commonalities and divergences with traditional interaction paradigms. The many v ..."
Abstract

Cited by 727 (23 self)
 Add to MetaCart
This paper factors out the common denominator underlying these variants: full decoupling of the communicating entities in time, space, and synchronization. We use these three decoupling dimensions to better identify commonalities and divergences with traditional interaction paradigms. The many
N Degrees of Separation: MultiDimensional Separation of Concerns
 IN PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 1999
"... Done well, separation of concerns can provide many software engineering benefits, including reduced complexity, improved reusability, and simpler evolution. The choice of boundaries for separate concerns depends on both requirements on the system and on the kind(s) of decompositionand composition a ..."
Abstract

Cited by 514 (8 self)
 Add to MetaCart
Done well, separation of concerns can provide many software engineering benefits, including reduced complexity, improved reusability, and simpler evolution. The choice of boundaries for separate concerns depends on both requirements on the system and on the kind(s) of decompositionand composition a
The Optimal Degree of Commitment to an Intermediate Monetary Target
 QUARTERLY JOURNAL OF ECONOMICS
, 1985
"... ..."
A Parallel Motion Planner for Systems with Many Degrees
 of Freedom, International Conference on Advanced Robotics
"... During the several decades of research, a number of algorithms intended to solve practical motion planning problems have been presented. However, the intractability of the problem makes it difficult to design algorithms capable of solving hard problems, especially when the number of degreesoffreed ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
offreedom is large. It is necessary to use all available means to extend the domain of practically solvable problem instances. This paper reports results for a parallel implementation of a motion planner based on twolevel search algorithm. The planner can solve difficult problems with many degreesoffreedom within
A Critical Point For Random Graphs With A Given Degree Sequence
, 2000
"... Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0 the ..."
Abstract

Cited by 511 (8 self)
 Add to MetaCart
Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1276 (124 self)
 Add to MetaCart
to be relatively easy to choose, Increased efficiency can also be achieved by tailoring some components of the method (e.g., the local planner) to the considered robots. In this paper the method is applied to planar articulated robots with many degrees of freedom. Experimental results show that path planning can
THE CASASALVERO CONJECTURE FOR INFINITELY MANY DEGREES
, 2006
"... Abstract. Over a field of characteristic zero, it is clear that a polynomial of the form (X − α) d has a nontrivial common factor with each of its d − 1 first derivatives. The converse has been conjectured by CasasAlvero. Up to now there have only been some computational verifications for small de ..."
Abstract
 Add to MetaCart
degrees d. In this paper the conjecture is proved in the case where the degree of the polynomial is a power of a prime number, or twice such a power. Moreover, for each positive characteristic p, we give an example of a monic polynomial of degree d which is not a dth power but which has a common factor
Heuristic Motion Planning with Many Degrees of Freedom
 FB 14 INFORMATIK, UNIV. DES SAARLANDES, SAARBR UCKEN
, 1996
"... We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divideandconquer path search strategy which makes inquiries about feasible paths; to answer these, we develop an efficient collision detection scheme ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divideandconquer path search strategy which makes inquiries about feasible paths; to answer these, we develop an efficient collision detection scheme that handles translations and rotations of polyhedra to compute all times of collision. The whole algorithm can be easily implemented and has been successfully tested in a program for assembly planning.
Results 1  10
of
2,615,547