Sciweavers

3663 search results - page 115 / 733
» Problems in the ontology of computer programs
Sort
View
AAAI
2004
14 years 11 months ago
QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems
Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user o...
Ulrich Junker
CCE
2004
14 years 9 months ago
Solving heat exchanger network synthesis problems with Tabu Search
: This paper describes the implementation of a meta-heuristic optimization approach, Tabu Search (TS), for Heat Exchanger Networks (HEN) synthesis and compares this approach to oth...
B. Lin, D. C. Miller
EMNLP
2008
14 years 11 months ago
Scalable Language Processing Algorithms for the Masses: A Case Study in Computing Word Co-occurrence Matrices with MapReduce
This paper explores the challenge of scaling up language processing algorithms to increasingly large datasets. While cluster computing has been available in commercial environment...
Jimmy J. Lin
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 3 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
ICFP
2001
ACM
15 years 10 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha