Sciweavers

11862 search results - page 60 / 2373
» Relative information completeness
Sort
View
TPDS
1998
124views more  TPDS 1998»
13 years 7 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
NIPS
2001
13 years 9 months ago
Fragment Completion in Humans and Machines
Partial information can trigger a complete memory. At the same time, human memory is not perfect. A cue can contain enough information to specify an item in memory, but fail to tr...
David Jacobs, Bas Rokers, Archisman Rudra, Zili Li...
SAT
2005
Springer
107views Hardware» more  SAT 2005»
14 years 1 months ago
Local and Global Complete Solution Learning Methods for QBF
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
Ian P. Gent, Andrew G. D. Rowley
CISS
2010
IEEE
12 years 11 months ago
Transmission completion time minimization in an energy harvesting system
Abstract—We consider the transmission completion time minimization problem in a single-user energy harvesting wireless communication system. In this system, both the data packets...
Jing Yang, Sennur Ulukus
ACL
2012
11 years 10 months ago
Computational Approaches to Sentence Completion
This paper studies the problem of sentencelevel semantic coherence by answering SATstyle sentence completion questions. These questions test the ability of algorithms to distingui...
Geoffrey Zweig, John C. Platt, Christopher Meek, C...