Sciweavers

5804 search results - page 72 / 1161
» Doing more with less
Sort
View
COGSCI
2010
75views more  COGSCI 2010»
15 years 6 months ago
Moral Principles or Consumer Preferences? Alternative Framings of the Trolley Problem
We created paired moral dilemmas with minimal contrasts in wording, a research strategy that has been advocated as a way to empirically establish principles operative in a domain-...
Tage S. Rai, Keith J. Holyoak
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
15 years 6 months ago
Constraint models for graceful graphs
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
Barbara M. Smith, Jean-François Puget
CN
2002
74views more  CN 2002»
15 years 5 months ago
Dynamic buffer management scheme based on rate estimation in packet-switched networks
Abstract-- While traffic volume of real-time applications is rapidly increasing, current routers do not guarantee minimum QoS values of fairness and they drop packets in random fas...
Jeong-woo Cho, Dong-Ho Cho
IJAR
2000
140views more  IJAR 2000»
15 years 5 months ago
Belief updating in multiply sectioned Bayesian networks without repeated local propagations
Multiply sectioned Bayesian networks (MSBNs) provide a coherent and flexible formalism for representing uncertain knowledge in large domains. Global consistency among subnets in a...
Yang Xiang
NETWORKS
2010
15 years 4 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum