Sciweavers

8132 search results - page 1423 / 1627
» Dependability, Abstraction, and Programming
Sort
View
CP
2003
Springer
15 years 11 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
CP
2003
Springer
15 years 11 months ago
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
Alessio Guerri, Michela Milano
FPL
2003
Springer
259views Hardware» more  FPL 2003»
15 years 11 months ago
Branch Optimisation Techniques for Hardware Compilation
Abstract. This paper explores using information about program branch probabilities to optimise reconfigurable designs. The basic premise is to promote utilization by dedicating mo...
Henry Styles, Wayne Luk
FSTTCS
2003
Springer
15 years 11 months ago
An Equational Theory for Transactions
Abstract. Transactions are commonly described as being ACID: Allor-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID pr...
Andrew P. Black, Vincent Cremet, Rachid Guerraoui,...
MSR
2010
ACM
15 years 11 months ago
Mining Challenge 2010: FreeBSD, GNOME Desktop and Debian/Ubuntu
Abstract—In a young field, such as Mining Software Repositories (MSR), there is always a call for benchmarks so that researchers can compare their results against others. Thus i...
Abram Hindle, Israel Herraiz, Emad Shihab, Zhen Mi...
« Prev « First page 1423 / 1627 Last » Next »