Sciweavers

10935 search results - page 2152 / 2187
» Neural Programming Language
Sort
View
CP
2005
Springer
15 years 3 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
75
Voted
CP
2005
Springer
15 years 3 months ago
Neighbourhood Clause Weight Redistribution in Local Search for SAT
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, ...
88
Voted
FPL
2005
Springer
122views Hardware» more  FPL 2005»
15 years 3 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...
ICALP
2005
Springer
15 years 3 months ago
On the Wake-Up Problem in Radio Networks
Abstract. Radio networks model wireless communication when processing units communicate using one wave frequency. This is captured by the property that multiple messages arriving s...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
110
Voted
ICALP
2005
Springer
15 years 3 months ago
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
Scott Diehl, Dieter van Melkebeek
« Prev « First page 2152 / 2187 Last » Next »