Sciweavers

9842 search results - page 1797 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
150
Voted
ISPA
2007
Springer
15 years 9 months ago
Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
Thara Angskun, George Bosilca, Jack Dongarra
135
Voted
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
15 years 9 months ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
102
Voted
KI
2007
Springer
15 years 9 months ago
Emotion Based Control Architecture for Robotics Applications
Assistance and service systems are one of the main research topics in robotics today. A major problem for creating these systems is that they have to work and navigate in the real ...
Jochen Hirth, Tim Braun, Karsten Berns
142
Voted
MATES
2007
Springer
15 years 9 months ago
Goal-Oriented Interaction Protocols
Developing agent applications is a complex and difficult task due to a variety of reasons. One key aspect making multi-agent systems more complicated than traditional applications ...
Lars Braubach, Alexander Pokahr
121
Voted
MDM
2007
Springer
15 years 9 months ago
Near Optimal Update-Broadcast of Data Sets
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
Sachin Agarwal, Andrew Hagedorn, Ari Trachtenberg
« Prev « First page 1797 / 1969 Last » Next »