Sciweavers

635 search results - page 33 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
78
Voted
FOSSACS
2001
Springer
15 years 2 months ago
Model Checking CTL+ and FCTL is Hard
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
François Laroussinie, Nicolas Markey, Ph. S...
62
Voted
INTERACT
2003
14 years 11 months ago
HCI Education in the Czech Republic
: In this paper we report on some problems arising during the building of an educational system in the area of human computer interaction in the Czech Republic. An overview of teac...
Václav Matousek, Pavel Slavík
MFCS
2005
Springer
15 years 3 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
79
Voted
COR
2008
124views more  COR 2008»
14 years 9 months ago
Max-min fairness in multi-commodity flows
In this paper, we provide a study of Max-Min Fair (MMF) multicommodity flows and focus on some of their applications to multi-commodity networks. We first present the theoretical ...
Dritan Nace, Nhat Linh Doan, Olivier Klopfenstein,...
75
Voted
IPPS
2002
IEEE
15 years 2 months ago
Aligning Two Fragmented Sequences
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
Vamsi Veeramachaneni, Piotr Berman, Webb Miller