6562 search results - page 377 / 1313 » Noetherianity and Combination Problems |
170
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
Model checking would answer all finite-state verification problems, if it were not for the notorious state-space explosion problem. A problem of practical importance, which attra...
150
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
This paper describes a two-state methodology for register transfer level (RTL) logic simulation in which the use of the Xstate is completely eliminated inside ASIC designs. Exampl...
185
click to vote
KI
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
146
click to vote
COMPGEOM
1990
ACM
15 years 11 months ago
1990
ACM
Practical solid modeling systems are plagued by numerical problems that arise from using oatingpoint arithmetic. For example, polyhedral solids are often represented by a combinat...
186
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...