Sciweavers

409 search results - page 56 / 82
» Modeling Motivation in MicroPsi 2
Sort
View
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 7 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
FOCS
2009
IEEE
14 years 2 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
IEEESCC
2007
IEEE
14 years 1 months ago
Deriving executable BPEL from UMM Business Transactions
UN/CEFACT’s Modeling Methodology (UMM) is a UML profile for modeling global B2B choreographies. The basic building blocks of UMM are business transactions, which describe the e...
Birgit Hofreiter, Christian Huemer, Philipp Liegl,...
CAISE
2004
Springer
14 years 28 days ago
Ontology for Characterising Architecture Frameworks
This paper outlines an ontology for characterising architecture frameworks. The ontology is based on the metamodel of MAF, and is currently being tried out on a set of well-known e...
Oddrun Pauline Ohren
GECCO
2004
Springer
175views Optimization» more  GECCO 2004»
14 years 28 days ago
Enhanced Innovation: A Fusion of Chance Discovery and Evolutionary Computation to Foster Creative Processes and Decision Making
Abstract. Human-based genetic algorithms are powerful tools for organizational modeling. If we enhance them using chance discovery techniques, we obtain an innovative approach for ...
Xavier Llorà, Kei Ohnishi, Ying-Ping Chen, ...