全文获取类型
收费全文 | 365篇 |
免费 | 6篇 |
国内免费 | 2篇 |
学科分类
工业技术 | 373篇 |
出版年
2023年 | 5篇 |
2022年 | 16篇 |
2021年 | 19篇 |
2020年 | 11篇 |
2019年 | 10篇 |
2018年 | 11篇 |
2017年 | 8篇 |
2016年 | 9篇 |
2015年 | 3篇 |
2014年 | 12篇 |
2013年 | 19篇 |
2012年 | 18篇 |
2011年 | 37篇 |
2010年 | 23篇 |
2009年 | 15篇 |
2008年 | 26篇 |
2007年 | 12篇 |
2006年 | 20篇 |
2005年 | 9篇 |
2004年 | 11篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 8篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1984年 | 2篇 |
1982年 | 6篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1977年 | 4篇 |
1969年 | 2篇 |
排序方式: 共有373条查询结果,搜索用时 15 毫秒
1.
Ciesielczyk Tomasz Cabrera Alberto Oleksiak Ariel Piątek Wojciech Waligóra Grzegorz Almeida Francisco Blanco Vicente 《Journal of Scheduling》2021,24(5):489-505
Journal of Scheduling - Rapid growth of demand for remote computational power, along with high energy costs and infrastructure limits, has led to treating power usage as a primary constraint in... 相似文献
2.
Yoram Bachrach Ariel Parnes Ariel D. Procaccia Jeffrey S. Rosenschein 《Autonomous Agents and Multi-Agent Systems》2009,19(2):153-172
Decentralized Reputation Systems have recently emerged as a prominent method of establishing trust among self-interested agents
in online environments. A key issue is the efficient aggregation of data in the system; several approaches have been proposed,
but they are plagued by major shortcomings. We put forward a novel, decentralized data management scheme grounded in gossip-based
algorithms. Rumor mongering is known to possess algorithmic advantages, and indeed, our framework inherits many of their salient
features: scalability, robustness, a global perspective, and simplicity. We demonstrate that our scheme motivates agents to
maintain a very high reputation, by showing that the higher an agent’s reputation is above the threshold set by its peers,
the more transactions it would be able to complete within a certain time unit. We analyze the relation between the amount
by which an agent’s average reputation exceeds the threshold and the time required to close a deal. This analysis is carried
out both theoretically, and empirically through a simulation system called GossipTrustSim. Finally, we show that our approach is inherently impervious to certain kinds of attacks.
A preliminary version of this article appeared in the proceedings of IJCAI 2007. 相似文献
3.
Robert P. Kurshan Michael Merritt Ariel Orda Sonia R. Sachs 《Formal Methods in System Design》1994,5(3):227-244
In [11], an induction principle for processes was given which allows one to apply model-checking techniques to parameterized families of processes. A limitation of the induction principle is that it does not apply to the case in which one process depends directly upon a parameterized number of processes, which grows without bound. This would seem to preclude its application to families ofN processes interconnected in a star topology. Nonetheless, we show that if the dependency can be computed incrementally, then the direct dependency upon the parameterized number of processes may be re-expressed recursively in terms of a linear cascade of processes, yielding in effect a linearization of the inter-process dependencies and allowing the induction principle to apply.A previous version of this paper appears in the Proceedings of CAV 1993 (LNCS 697). 相似文献
4.
Alon Lerner Yiorgos Chrysanthou Ariel Shamir Daniel Cohen‐Or 《Computer Graphics Forum》2010,29(7):2197-2206
Many times, even if a crowd simulation looks good in general, there could be some specific individual behaviors which do not seem correct. Spotting such problems manually can become tedious, but ignoring them may harm the simulation's credibility. In this paper we present a data‐driven approach for evaluating the behaviors of individuals within a simulated crowd. Based on video‐footage of a real crowd, a database of behavior examples is generated. Given a simulation of a crowd, an analog analysis is performed on it, defining a set of queries, which are matched by a similarity function to the database examples. The results offer a possible objective answer to the question of how similar are the simulated individual behaviors to real observed behaviors. Moreover, by changing the video input one can change the context of evaluation. We show several examples of evaluating simulated crowds produced using different techniques and comprising of dense crowds, sparse crowds and flocks. 相似文献
5.
A new fast prototype selection method based on clustering 总被引:2,自引:1,他引:1
J. Arturo Olvera-López J. Ariel Carrasco-Ochoa J. Francisco Martínez-Trinidad 《Pattern Analysis & Applications》2010,13(2):131-141
In supervised classification, a training set T is given to a classifier for classifying new prototypes. In practice, not all information in T is useful for classifiers, therefore, it is convenient to discard irrelevant prototypes from T. This process is known as prototype selection, which is an important task for classifiers since through this process the
time for classification or training could be reduced. In this work, we propose a new fast prototype selection method for large
datasets, based on clustering, which selects border prototypes and some interior prototypes. Experimental results showing
the performance of our method and comparing accuracy and runtimes against other prototype selection methods are reported. 相似文献
6.
Ignacio Peñarrocha Daniel Dolz Julio Ariel Romero Roberto Sanchis 《International journal of systems science》2016,47(2):283-299
This work presents a strategy to minimise the network usage and the energy consumption of wireless battery-powered sensors in the observer problem over networks. The sensor nodes implement a periodic send-on-delta approach, sending new measurements when a measure deviates considerably from the previous sent one. The estimator node implements a jump observer whose gains are computed offline and depend on the combination of available new measurements. We bound the estimator performance as a function of the sending policies and then state the design procedure of the observer under fixed sending thresholds as a semidefinite programming problem. We address this problem first in a deterministic way and, to reduce conservativeness, in a stochastic one after obtaining bounds on the probabilities of having new measurements and applying robust optimisation problem over the possible probabilities using sum of squares decomposition. We relate the network usage with the sending thresholds and propose an iterative procedure for the design of those thresholds, minimising the network usage while guaranteeing a prescribed estimation performance. Simulation results and experimental analysis show the validity of the proposal and the reduction of network resources that can be achieved with the stochastic approach. 相似文献
7.
Ariel Felner Uzi Zahavi Robert Holte Jonathan Schaeffer Nathan Sturtevant Zhifu Zhang 《Artificial Intelligence》2011,175(9-10):1570-1603
In the field of heuristic search it is usually assumed that admissible heuristics are consistent, implying that consistency is a desirable attribute. The term “inconsistent heuristic” has, at times, been portrayed negatively, as something to be avoided. Part of this is historical: early research discovered that inconsistency can lead to poor performance for A? (nodes might be re-expanded many times). However, the issue has never been fully investigated, and was not re-considered after the invention of IDA?.This paper shows that many of the preconceived notions about inconsistent heuristics are outdated. The worst-case exponential time of inconsistent heuristics is shown to only occur on contrived graphs with edge weights that are exponential in the size of the graph. Furthermore, the paper shows that rather than being something to be avoided, inconsistent heuristics often add a diversity of heuristic values into a search which can lead to a reduction in the number of node expansions. Inconsistent heuristics are easy to create, contrary to the common perception in the AI literature. To demonstrate this, a number of methods for achieving effective inconsistent heuristics are presented.Pathmax is a way of propagating inconsistent heuristic values in the search from parent to children. This technique is generalized into bidirectional pathmax (BPMX) which propagates values from a parent to a child node, and vice versa. BPMX can be integrated into IDA? and A?. When inconsistent heuristics are used with BPMX, experimental results show a large reduction in the search effort required by IDA?. Positive results are also presented for A? searches. 相似文献
8.
Krzysztof Kurowski Jarek Nabrzyski Ariel Oleksiak Jan Węglarz 《Journal of Scheduling》2008,11(5):371-379
In this paper we address a multicriteria scheduling problem for computational Grid systems. We focus on the two-level hierarchical
Grid scheduling problem, in which at the first level (the Grid level) a Grid broker makes scheduling decisions and allocates
jobs to Grid nodes. Jobs are then sent to the Grid nodes, where local schedulers generate local schedules for each node accordingly.
A general approach is presented taking into account preferences of all the stakeholders of Grid scheduling (end-users, Grid
administrators, and local resource providers) and assuming a lack of knowledge about job time characteristics. A single-stakeholder,
single-criterion version of the approach has been compared experimentally with the existing approaches. 相似文献
9.
Ariel Sabiguero Anthony Baire César Viho 《International Journal on Software Tools for Technology Transfer (STTT)》2008,10(4):337-346
TTCN-3 is an abstract language for specification of Abstract Test Suites. Coding of TTCN-3 values into physically transmittable
messages and decoding of bitstrings into their TTCN-3 representation has been removed from the language itself and relayed
to external and specialized components, called CoDec. CoDec development, either implicitly or explicitly, is a must in any
TTCN-3 testing activity. Field experience showed that there is a high cost associated with CoDec development and maintenance.
To achieve adequate software engineering practices, a set of types, tools and definitions were developed. This paper unveils
gray areas in TTCN-3 architecture and presents a methodological approach to minimize the complexity of CoDec development.
Even though the initial field of application is IPv6 testing, the main tool introduced—the CoDec Generator—is a valuable tool
in any testing application domain. It is designed to lower the CoDec maintenance costs in all test case lifecycle stages,
from development to maintenance.
This work has been partly supported by the IST Go4IT European project: . 相似文献
10.