Sciweavers

1432 search results - page 216 / 287
» Hardness of robust network design
Sort
View
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
15 years 7 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu
AAMAS
2007
Springer
15 years 6 months ago
A formal framework for connective stability of highly decentralized cooperative negotiations
Abstract. Multiagent cooperative negotiation is a promising technique for modeling and controlling complex systems. Effective and flexible cooperative negotiations are especially...
Francesco Amigoni, Nicola Gatti
JMS
2010
139views more  JMS 2010»
15 years 4 months ago
Application of Portable CDA for Secure Clinical-document Exchange
Health Level Seven (HL7) organization published the Clinical Document Architecture (CDA) for exchanging documents among heterogeneous systems and improving medical quality based on...
Kuo-Hsuan Huang, Sung-huai Hsieh, Yuan-Jen Chang, ...

Publication
266views
14 years 11 months ago
NeuFlow: A Runtime Reconfigurable Dataflow Processor for Vision
In this paper we present a scalable dataflow hard- ware architecture optimized for the computation of general- purpose vision algorithms—neuFlow—and a dataflow compiler—luaFl...
C. Farabet, B. Martini, B. Corda, P. Akselrod, E. ...
COCOON
2011
Springer
14 years 6 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...