Sciweavers

4539 search results - page 73 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ECAI
2008
Springer
14 years 11 months ago
Infection-Based Norm Emergence in Multi-Agent Complex Networks
We propose a computational model that facilitates agents in a MAS to collaboratively evolve their norms to reach the best norm conventions. Our approach borrows from the social con...
Norman Salazar, Juan A. Rodríguez-Aguilar, ...
DCC
1999
IEEE
15 years 2 months ago
Complexity-Distortion Tradeoffs in Vector Matching Based on Probabilistic Partial Distance Techniques
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
Krisda Lengwehasatit, Antonio Ortega
DAC
1998
ACM
15 years 10 months ago
A Programming Environment for the Design of Complex High Speed ASICs
A C++ based programming environment for the design of complex high speed ASICs is presented. The design of a 75 Kgate DECT transceiver is used as a driver example. Compact descrip...
Patrick Schaumont, Serge Vernalde, Luc Rijnders, M...
CVPR
2012
IEEE
13 years 9 days ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori
ICIP
2000
IEEE
15 years 11 months ago
Rate-Complexity-Distortion Optimization for Quadtree-Based DCT Coding
In this paper, we study rate-complexity-distortion (R-C-D) tradeoffs for video coding, where we focus on the complexity of computing the inverse DCT. A quadtree coding approach is...
Krisda Lengwehasatit, Antonio Ortega