Sciweavers

5022 search results - page 673 / 1005
» Data structures and problem solving using Java
Sort
View
SIGMOD
2012
ACM
288views Database» more  SIGMOD 2012»
13 years 5 months ago
Exploiting MapReduce-based similarity joins
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Sim...
Yasin N. Silva, Jason M. Reed
145
Voted
CADE
2005
Springer
16 years 3 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill
119
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
159
Voted
STEP
2003
IEEE
15 years 8 months ago
On Analysis of Design Component Contracts: A Case Study
Software patterns are a new design paradigm used to solve problems that arise when developing software within a particular context. Patterns capture the static and dynamic structu...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan
109
Voted
ECAI
2006
Springer
15 years 7 months ago
A Solver for QBFs in Nonprenex Form
Various problems in AI can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a ...
Uwe Egly, Martina Seidl, Stefan Woltran