Sciweavers

1960 search results - page 165 / 392
» The Logic of Large Enough
Sort
View
ICCAD
2007
IEEE
102views Hardware» more  ICCAD 2007»
14 years 6 months ago
Scalable exploration of functional dependency by interpolation and incremental SAT solving
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
Chih-Chun Lee, Jie-Hong Roland Jiang, Chung-Yang H...
WISE
2005
Springer
14 years 2 months ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
SIGIR
2009
ACM
14 years 3 months ago
Evaluating web search using task completion time
We consider experiments to measure the quality of a web search algorithm based on how much total time users take to complete assigned search tasks using that algorithm. We first ...
Ya Xu, David Mease
INFOCOM
2006
IEEE
14 years 3 months ago
Routers with Very Small Buffers
Abstract— Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory ...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
SBCCI
2006
ACM
139views VLSI» more  SBCCI 2006»
14 years 3 months ago
Infrastructure for dynamic reconfigurable systems: choices and trade-offs
Platform-based design is a method to implement complex SoCs, avoiding chip design from scratch. A promising evolution of platform-based design are MPSoC. Such generic architecture...
Leandro Möller, Rafael Soares, Ewerson Carval...