Sciweavers

16843 search results - page 330 / 3369
» On Generalized Authorization Problems
Sort
View
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
15 years 11 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
SIGIR
2009
ACM
16 years 1 months ago
Visualizing the problems with the INEX topics
Topics form a crucial component of a test collection. We show, through visualization, that the INEX 2008 topics have shortcomings, which questions their validity for evaluating XM...
Andrew Trotman, Maria del Rocio Gomez Crisostomo, ...
IPPS
2005
IEEE
16 years 7 days ago
Some Issues in Solving the Anomaly Detection Problem using Immunological Approach
Results of an experimental study of an anomaly detection system based on the paradigm of artificial immune systems (AISs) are presented. Network traffic data are mapped into ant...
Franciszek Seredynski, Pascal Bouvry
CAISE
2004
Springer
16 years 1 days ago
A Model-based Ontology of the Software Interoperability Problem: Preliminary Results
Interoperability usually refers to software system communication. Although there is no widely accepted definition, and therefore no common understanding of the context, there are m...
Vincent Rosener, Thibaud Latour, Eric Dubois
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
15 years 12 months ago
Multi-Agent Systems and Microeconomic Theory: A Negotiation Approach to Solve Scheduling Problems in High Dynamic Environments
Microeconomics offer a far developed theory on the subject of rational choice. This theory is applied to a multi-agent system, which has been modeled in order to establish schedul...
Hans Czap, Marc Becker