3244 search results - page 317 / 649 » On convex complexity measures |
212
click to vote
EMSOFT
2005
Springer
16 years 7 days ago
2005
Springer
Real-time systems have reached a level of complexity beyond the scaling capability of the low-level or restricted languages traditionally used for real-time programming. While Met...
236
click to vote
SPATIALCOGNITION
2000
Springer
15 years 10 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
199
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
191
click to vote
OPODIS
2007
15 years 8 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
185
click to vote
DAGSTUHL
2003
15 years 8 months ago
2003
Abstract. In this paper, we show how the concepts of objects, components, features and agents are used today in the Agent Building Center (ABC) environment in order to marry the mo...