Sciweavers

9626 search results - page 1844 / 1926
» Invariant Based Programming
Sort
View
CP
2005
Springer
15 years 5 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
FPL
2005
Springer
122views Hardware» more  FPL 2005»
15 years 5 months ago
FPGA-Aware Garbage Collection in Java
— During codesign of a system, one still runs into the impedance mismatch between the software and hardware worlds. er identifies the different levels of abstraction of hardware...
Philippe Faes, Mark Christiaens, Dries Buytaert, D...
OOPSLA
2005
Springer
15 years 5 months ago
MDAbench: a tool for customized benchmark generation using MDA
Designing component-based application that meets performance requirements remains a challenging problem, and usually requires a prototype to be constructed to benchmark performanc...
Liming Zhu, Yan Liu, Ian Gorton, Ngoc Bao Bui
SSS
2005
Springer
132views Control Systems» more  SSS 2005»
15 years 5 months ago
Self-stabilizing Mobile Node Location Management and Message Routing
We present simple algorithms for achieving self-stabilizing location management and routing in mobile ad-hoc networks. While mobile clients may be susceptible to corruption and sto...
Shlomi Dolev, Limor Lahiani, Nancy A. Lynch, Tina ...
WINE
2005
Springer
100views Economy» more  WINE 2005»
15 years 5 months ago
A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Va...
« Prev « First page 1844 / 1926 Last » Next »