Sciweavers

12742 search results - page 377 / 2549
» On canonical number systems
Sort
View
CC
2004
Springer
122views System Software» more  CC 2004»
16 years 6 days ago
An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
Erin Parker, Siddhartha Chatterjee
CBMS
2006
IEEE
15 years 10 months ago
Automatic Extraction of Bibliographic Information from Biomedical Online Journal Articles Using a String Matching Algorithm
A system has been developed to extract bibliographic data (grant numbers and databank accession numbers) from online biomedical journal articles for the National Library of Medici...
Jongwoo Kim, Daniel X. Le, George R. Thoma
STOC
1994
ACM
95views Algorithms» more  STOC 1994»
15 years 10 months ago
Improved non-approximability results
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
Mihir Bellare, Madhu Sudan
DLOG
2000
15 years 8 months ago
High Performance Reasoning with Very Large Knowledge Bases
In this contribution we present an empirical analysis of the performance of the ALCNHR+ description logic system RACE applied to TBoxes with a very large number of primitive conce...
Volker Haarslev, Ralf Möller
JDA
2008
85views more  JDA 2008»
15 years 6 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...