Sciweavers

11740 search results - page 461 / 2348
» More Problems in Rewriting
Sort
View
HICSS
2007
IEEE
141views Biometrics» more  HICSS 2007»
16 years 1 months ago
Second-Best Combinatorial Auctions - The Case of the Pricing-Per-Column Mechanism
One of the main contributions of classical mechanism design is the derivation of the Groves mechanisms. The class of Groves mechanisms are the only mechanisms that are strategy-pr...
Dirk Neumann, Björn Schnizler, Ilka Weber, Ch...
ICC
2007
IEEE
145views Communications» more  ICC 2007»
16 years 1 months ago
Distributed Optimization for Utility-Energy Tradeoff in Wireless Sensor Networks
Abstract— Wireless sensor networks (WSNs) are energyconstrained in nature, in this paper, we formulate the problem of data transport in sensor networks as a network utility maxim...
Shengbin Liao, Wenqing Cheng, Wei Liu, Zongkai Yan...
IROS
2007
IEEE
110views Robotics» more  IROS 2007»
16 years 1 months ago
Multi-agent search with interim positive information
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
Haye Lau, Shoudong Huang, Gamini Dissanayake
CP
2007
Springer
16 years 1 months ago
The Log-Support Encoding of CSP into SAT
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Marco Gavanelli
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
16 years 1 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...