Sciweavers

3598 search results - page 313 / 720
» New efficient algorithms for computing effective capacitance
Sort
View
AAMAS
2005
Springer
15 years 6 months ago
Argumentation and the Dynamics of Warranted Beliefs in Changing Environments
One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New p...
Marcela Capobianco, Carlos Iván Chesñ...

Publication
156views
17 years 5 months ago
On Determining the Fair Bandwidth Share for ABR Connections in ATM Networks
In a multi-service network such as ATM, adaptive data services ( such as ABR) share the bandwidth left unused by higher priority services. The network indicates to the ABR sources ...
Sonia Fahmy, Raj Jain, Shivkumar Kalyanaraman, Roh...
CAISE
2006
Springer
15 years 8 months ago
Incremental Evaluation of OCL Constraints
: Integrity checking is aimed at determining whether an operation execution violates a given integrity constraint. To perform this computation efficiently, several incremental meth...
Jordi Cabot, Ernest Teniente
TNN
2010
159views Management» more  TNN 2010»
15 years 1 months ago
Multiple incremental decremental learning of support vector machines
We propose a multiple incremental decremental algorithm of Support Vector Machine (SVM). Conventional single incremental decremental SVM can update the trained model efficiently w...
Masayuki Karasuyama, Ichiro Takeuchi
CVPR
2007
IEEE
16 years 8 months ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios