Sciweavers

1404 search results - page 17 / 281
» Complexity of admissible rules
Sort
View
CSCLP
2008
Springer
14 years 4 days ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
ESAW
2006
Springer
14 years 2 months ago
Competence Checking for the Global E-Service Society Using Games
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
Kostas Stathis, George Lekeas, Christos Kloukinas
ICC
2007
IEEE
144views Communications» more  ICC 2007»
14 years 4 months ago
Buffer Occupancy-Based CAC in Converged IP and Broadcasting Networks
— This paper introduces a buffer occupancy -based admission control mechanism aimed to counter link congestion while fairly sharing the bandwidth in converged IP and broadcasting...
Yassine Hadjadj Aoul, Abdelhamid Nafaa, Ahmed Meha...
SPAA
2004
ACM
14 years 3 months ago
Improved combination of online algorithms for acceptance and rejection
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
David P. Bunde, Yishay Mansour
MLG
2007
Springer
14 years 4 months ago
Transductive Rademacher Complexities for Learning Over a Graph
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
Kristiaan Pelckmans, Johan A. K. Suykens