Sciweavers

549 search results - page 88 / 110
» Constraint Programming in Structural Bioinformatics
Sort
View
ASPDAC
2007
ACM
119views Hardware» more  ASPDAC 2007»
15 years 6 months ago
Optimum Prefix Adders in a Comprehensive Area, Timing and Power Design Space
Parallel prefix adder is the most flexible and widely-used binary adder for ASIC designs. Many high-level synthesis techniques have been developed to find optimal prefix structures...
Jianhua Liu, Yi Zhu, Haikun Zhu, Chung-Kuan Cheng,...
IJCAI
2007
15 years 3 months ago
Arc Consistency during Search
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
Chavalit Likitvivatanavong, Yuanlin Zhang, Scott S...
CISS
2007
IEEE
15 years 2 months ago
Robust Routing in Wireless Multi-Hop Networks
This paper introduces a robust approach to stochastic multi-hop routing for wireless networks when the quality of links is modelled through a reliability matrix R. Yielding to the ...
Yuchen Wu, Alejandro Ribeiro, Georgios B. Giannaki...
114
Voted
CLOUDCOM
2010
Springer
15 years 16 days ago
Cost-Optimal Outsourcing of Applications into the Clouds
Abstract--Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities fo...
Immanuel Trummer, Frank Leymann, Ralph Mietzner, W...
CP
2007
Springer
15 years 8 months ago
Tradeoffs in the Complexity of Backdoor Detection
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...