Sciweavers

1101 search results - page 15 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
CCS
2004
ACM
15 years 3 months ago
Comparing the expressive power of access control models
Comparing the expressive power of access control models is recognized as a fundamental problem in computer security. Such comparisons are generally based on simulations between di...
Mahesh V. Tripunitara, Ninghui Li
MFCS
2010
Springer
14 years 8 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
JAL
2008
74views more  JAL 2008»
14 years 9 months ago
Solving satisfiability in the tile assembly model with a constant-size tileset
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
Yuriy Brun
FOCS
2008
IEEE
14 years 9 months ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan
70
Voted
TPDS
2008
117views more  TPDS 2008»
14 years 9 months ago
Energy-Efficient Thermal-Aware Task Scheduling for Homogeneous High-Performance Computing Data Centers: A Cyber-Physical Approac
High Performance Computing data centers have been rapidly growing, both in number and size. Thermal management of data centers can address dominant problems associated with cooling...
Qinghui Tang, Sandeep K. S. Gupta, Georgios Varsam...