Sciweavers

292 search results - page 23 / 59
» Are Stable Instances Easy
Sort
View
92
Voted
IJISEC
2007
63views more  IJISEC 2007»
15 years 20 days ago
A familiarity-based trust model for effective selection of sellers in multiagent e-commerce systems
In electronic marketplaces, trust is modeled, for instance, in order to allow buying agents to make effective selection of selling agents. Familiarity is often considered to be an ...
Jie Zhang, Ali A. Ghorbani, Robin Cohen
102
Voted
ECOWS
2010
Springer
14 years 10 months ago
Shepherd: node monitors for fault-tolerant distributed process execution in OSIRIS
OSIRIS is a middleware for the composition and orchestration of distributed web services that follows a P2P decentralized approach to process execution, providing already some deg...
Diego Milano, Nenad Stojnic
113
Voted
GLOBECOM
2009
IEEE
14 years 10 months ago
Joint Scheduling and Instantaneously Decodable Network Coding
We consider a wireless multi-hop network and design an algorithm for jointly optimal scheduling of packet transmissions and network coding. We consider network coding across differ...
Danail Traskov, Muriel Médard, Parastoo Sad...
88
Voted
AE
2007
Springer
15 years 7 months ago
An Evolutionary Algorithm for the Block Stacking Problem
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...
Tim Hohm, Matthias Egli, Samuel Gaehwiler, Stefan ...
IEE
2008
117views more  IEE 2008»
15 years 8 days ago
Formal verification of systems with an unlimited number of components
1 2 3 In many real component-based systems and patterns of component interaction, there can be identified a stable part (like control component, server, instance handler) and a nu...
Pavlína Vareková, Barbora Zimmerova,...