Sciweavers

3221 search results - page 484 / 645
» Termination of Linear Programs
Sort
View
ASPDAC
2005
ACM
117views Hardware» more  ASPDAC 2005»
15 years 12 months ago
Dynamic symmetry-breaking for improved Boolean optimization
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
WOWMOM
2005
ACM
109views Multimedia» more  WOWMOM 2005»
15 years 12 months ago
On Maximizing Lifetime of a Sensor Cluster
We consider the energy consumed in radio transmission of a set of sensors forming a data gathering wireless network. Our objective is to enhance the lifetime of such networks by e...
Samar Agnihotri, Pavan Nuggehalli, H. S. Jamadagni
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 10 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
BMCBI
2007
124views more  BMCBI 2007»
15 years 6 months ago
Protein structural similarity search by Ramachandran codes
Background: Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed...
Wei-Cheng Lo, Po-Jung Huang, Chih-Hung Chang, Ping...
BMCBI
2005
115views more  BMCBI 2005»
15 years 6 months ago
SUPERFICIAL - Surface mapping of proteins via structure-based peptide library design
Background: The determination of protein surfaces and the detection of binding sites are essential to our understanding of protein-protein interactions. Such binding sites can be ...
Andrean Goede, Ines S. Jaeger, Robert Preissner