Sciweavers

304 search results - page 58 / 61
» Analysis of the paraconsistency in some logics
Sort
View
ER
2007
Springer
146views Database» more  ER 2007»
13 years 11 months ago
Achieving, Satisficing, and Excelling
Abstract. Definitions of the concepts derived from the goal concept (including functional and nonfunctional goal, hardgoal, and softgoal) used in requirements engineering are discu...
Ivan Jureta, Stéphane Faulkner, Pierre-Yves...
HT
1987
ACM
13 years 11 months ago
Exploring Representation Problems Using Hypertext
Hypertext is a technology well-suited to exploring different kinds of representational problems. It can be used first as an informal mechanism to describe the attributes of object...
Catherine C. Marshall
PEPM
2010
ACM
13 years 9 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
CJ
2006
84views more  CJ 2006»
13 years 7 months ago
Instruction Level Parallelism through Microthreading - A Scalable Approach to Chip Multiprocessors
Most microprocessor chips today use an out-of-order instruction execution mechanism. This mechanism allows superscalar processors to extract reasonably high levels of instruction ...
Kostas Bousias, Nabil Hasasneh, Chris R. Jesshope
IOR
2006
177views more  IOR 2006»
13 years 7 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti