Sciweavers

97 search results - page 17 / 20
» Simple optimization techniques for A*-based search
Sort
View
DAC
2006
ACM
14 years 8 months ago
Efficient SAT-based Boolean matching for FPGA technology mapping
Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...
Sean Safarpour, Andreas G. Veneris, Gregg Baeckler...
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
14 years 1 months ago
Game Theoretic Control for Robot Teams
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
13 years 11 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
14 years 1 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
AAAI
2000
13 years 8 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith