Sciweavers

209 search results - page 32 / 42
» The Computational Complexity of Weak Saddles
Sort
View
PIMRC
2008
IEEE
14 years 1 months ago
Downlink overhead reduction for Multi-Cell Cooperative Processing enabled wireless networks
—Multi-cell Cooperative Processing (MCP) has been recognised as an efficient technique for increasing spectral efficiency of future cellular systems. However the provided bene...
Agisilaos Papadogiannis, Hans Jørgen Bang, ...
AOSE
2004
Springer
14 years 27 days ago
A Framework for Patterns in Gaia: A Case-Study with Organisations
Abstract. The agent-oriented approach has been successfully applied to the solution of complex problems in dynamic open environments. However, to extend its use to mainstream compu...
Jorge Gonzalez-Palacios, Michael Luck
OOPSLA
2009
Springer
14 years 1 days ago
Agile anthropology and Alexander's architecture: an essay in three voices
During its formative decades the software community looked twice to the theories of ChristopherAlexander for inspiration, both times failing to completely master the architect’s...
Jenny Quillien, Pam Rostal, Dave West
CP
1997
Springer
13 years 11 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
COMPGEOM
1993
ACM
13 years 11 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...