Sciweavers

3775 search results - page 13 / 755
» The Expression Problem Revisited
Sort
View
IEEEPACT
2008
IEEE
14 years 1 months ago
Redundancy elimination revisited
This work proposes and evaluates improvements to previously known algorithms for redundancy elimination. Enhanced Scalar Replacement combines two classic techniques, scalar replac...
Keith D. Cooper, Jason Eckhardt, Ken Kennedy
AISC
2010
Springer
14 years 6 days ago
A Revisited Perspective on Symbolic Mathematical Computing and Artificial Intelligence
We provide a perspective on the current state and possible future of links between symbolic mathematical computing and artificial intelligence, on the occasion of the 10th biennial...
Jacques Calmet, John A. Campbell
APAL
2004
81views more  APAL 2004»
13 years 7 months ago
The complexity of first-order and monadic second-order logic revisited
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
Markus Frick, Martin Grohe
JOT
2007
104views more  JOT 2007»
13 years 7 months ago
Common Requirements Problems, Their Negative Consequences, and the Industry Best Practices to Help Solve Them
In this column, I summarize the 12 worst of the most common requirements engineering problems I have observed over many years working on and with real projects as a requirements e...
Donald Firesmith
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
14 years 2 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard