Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Katriel, Irit"'
Publikováno v:
In Journal of Discrete Algorithms 2011 9(4):314-325
Publikováno v:
In Theoretical Computer Science 2008 408(2):213-223
Publikováno v:
In Journal of Computer and System Sciences 2008 74(5):884-897
Autor:
Katriel, Irit1 irit@cs.brown.edu
Publikováno v:
INFORMS Journal on Computing. Spring2008, Vol. 20 Issue 2, p205-211. 7p. 3 Diagrams.
Autor:
Beldiceanu, Nicolas1 Nicolas.Beldiceanu@emn.fr, Katriel, Irit2 irit@cs.brown.edu, Lorca, Xavier1 Xavier.Lorca@emn.fr
Publikováno v:
Annals of Operations Research. Oct2009, Vol. 171 Issue 1, p127-147. 21p. 11 Diagrams, 2 Charts.
Autor:
Katriel, Irit, Van Hentenryck, Pascal
Publikováno v:
Katriel, I & Van Hentenryck, P 2008, ' Randomized Filtering Algorithms ', Psychopharmacology Update, vol. CS-06-09 .
Filtering every global constraint of a CPS to are consistency at every search step can be costly and solvers often compromise on either the level of consistency or the frequency at which are consistency is enforced.In this paper we propose two random
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::599d54c353f3254e0c4f87a466a5c2df
https://pure.au.dk/portal/da/publications/randomized-filtering-algorithms(0405c010-c28b-11db-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/randomized-filtering-algorithms(0405c010-c28b-11db-bee9-02004c4f4f50).html
Publikováno v:
Brodal, G S, Georgiadis, L, Hansen, K A & Katriel, I 2007, Dynamic Matchings in Convex Bipartite Graphs . in L Kucera & A Kucera (eds), Proc. 32nd International Symposium on Mathematical Foundations of Computer Science . Springer, Lecture Notes in Computer Science, vol. 4708, pp. 406-417, Providence, RI, United States, 20/10/2007 . https://doi.org/10.1007/978-3-540-74456-6_37
We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::75a0c813056b4aa356793c1468f3b058
https://pure.au.dk/portal/da/publications/dynamic-matchings-in-convex-bipartite-graphs(6b7bb9e0-9d99-11dc-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/dynamic-matchings-in-convex-bipartite-graphs(6b7bb9e0-9d99-11dc-bee9-02004c4f4f50).html
Publikováno v:
Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC06)
Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC06), 2006, Nîmes-Ecole des Mines d'Alès / France
Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC06), 2006, Nîmes-Ecole des Mines d'Alès / France
Nous présentons deux contraintes qui partitionnent les sommets d'un graphe non-orienté G = (V, E), où |V| = n et |E| = m, en un ensemble d'arbres disjoints. La première contrainte, resource-forest, spécifie que chaque arbre dans la forêt doit c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::57b792ffcc87f8fb66dad59a5b5a8580
https://hal.inria.fr/inria-00085803/file/35.pdf
https://hal.inria.fr/inria-00085803/file/35.pdf
Autor:
Katriel, Irit
Publikováno v:
Katriel, I 2006, Expected-Case Analysis for Delayed Filtering . in Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems . LNCS 3990 edn, Springer, pp. 119-125, Cork, Ireland, 17/12/2010 .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::c7e893d08738d76ffa96e0d453a29b23
https://pure.au.dk/portal/da/publications/expectedcase-analysis-for-delayed-filtering(ab04e740-cd73-11db-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/expectedcase-analysis-for-delayed-filtering(ab04e740-cd73-11db-bee9-02004c4f4f50).html