Sciweavers

2681 search results - page 305 / 537
» Problem F
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
ATAL
2000
Springer
15 years 11 months ago
Agent Programming with Declarative Goals
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
EOR
2006
148views more  EOR 2006»
15 years 6 months ago
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
Karl F. Doerner, Walter J. Gutjahr, Richard F. Har...
3DOR
2010
15 years 1 months ago
Learning the Compositional Structure of Man-Made Objects for 3D Shape Retrieval
While approaches based on local features play a more and more important role for 3D shape retrieval, the problems of feature selection and similarity measurement between sets of l...
Raoul Wessel, Reinhard Klein
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 4 months ago
Balanced Interval Coloring
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two co...
Antonios Antoniadis, Falk Hüffner, Pascal Len...