Sciweavers

150 search results - page 30 / 30
» Counting Results in Weak Formalisms
Sort
View
JSYML
2008
66views more  JSYML 2008»
13 years 6 months ago
Special groups whose isometry relation is a finite union of cosets
0-stable 0-categorical linked quaternionic mappings are studied and are shown to correspond (in some sense) to special groups which are 0stable, 0-categorical, satisfy AP(3) and ha...
Vincent Astier
SCP
2000
119views more  SCP 2000»
13 years 6 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
INFORMS
1998
150views more  INFORMS 1998»
13 years 6 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
IGPL
2010
158views more  IGPL 2010»
13 years 4 months ago
Ontology-revision operators based on reinterpretation
Communication between natural or artificial agents relies on the use of a common vocabulary. Since sharing terms does not necessarily imply that the terms have exactly the same m...
Carola Eschenbach, Özgür L. Öz&cced...
WWW
2003
ACM
14 years 7 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...