Sciweavers

520 search results - page 15 / 104
» Map-reduce as a Programming Model for Custom Computing Machi...
Sort
View
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 4 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
141
Voted
COR
2011
14 years 4 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
CONEXT
2010
ACM
14 years 7 months ago
NEVERMIND, the problem is already fixed: proactively detecting and troubleshooting customer DSL problems
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
Yu Jin, Nick G. Duffield, Alexandre Gerber, Patric...
CCE
2008
14 years 9 months ago
Chemical supply chain network optimization
Chemical supply chain networks provide large opportunities for cost reductions through the redesign of the flow of material from producer to customer. In this paper we present a m...
Jeff Ferrio, John Wassick
IFIP
1993
Springer
15 years 1 months ago
Plant Engineering: Conceptual Modeling and Modular Design of a Computer Aided Environment
When designing a plant for continuous or semi-continuous processes, such as paper pulp or petrochemical production systems, engineers face very complex tasks, which are only in pa...
Cláudio Walter, José Palazzo M. de O...