Sciweavers

5158 search results - page 156 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
JCT
2011
66views more  JCT 2011»
13 years 5 months ago
Enumeration of non-crossing pairings on bit strings
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...
POPL
2012
ACM
12 years 5 months ago
The marriage of bisimulations and Kripke logical relations
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...
ICEGOV
2009
ACM
14 years 4 months ago
Framework of e-governance at the local government level
With presumptions that e-government theories prevail in various formats and concepts around the globe, nations and institutions, not many examples are there to emulate in terms of...
Hakikur Rahman
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
14 years 3 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
SAT
2004
Springer
106views Hardware» more  SAT 2004»
14 years 3 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski