Sciweavers

3897 search results - page 208 / 780
» complexity 2010
Sort
View
122
Voted
BIRTHDAY
2010
Springer
15 years 6 months ago
Finding Reductions Automatically
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
Michael Crouch, Neil Immerman, J. Eliot B. Moss
SCHEDULING
2010
137views more  SCHEDULING 2010»
15 years 3 months ago
Criticality analysis of activity networks under interval uncertainty
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formu...
Jérôme Fortin, Pawel Zielinski, Didie...
NAACL
2010
15 years 3 months ago
Why Synchronous Tree Substitution Grammars?
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
Andreas Maletti
147
Voted
TIT
2010
112views Education» more  TIT 2010»
14 years 11 months ago
Codes for deletion and insertion channels with segmented errors
Abstract-- We consider deletion channels and insertion channels under an additional segmentation assumption: the input consists of disjoint segments of b consecutive bits, with at ...
Zhenming Liu, Michael Mitzenmacher
144
Voted
ICS
2010
Tsinghua U.
15 years 10 months ago
Overlapping communication and computation by using a hybrid MPI/SMPSs approach
– Communication overhead is one of the dominant factors that affect performance in high-performance computing systems. To reduce the negative impact of communication, programmers...
Vladimir Marjanovic, Jesús Labarta, Eduard ...